### How to design a Node in Tree?

How to design a Node in Tree?

There are three main components of a tree in a node.

1) Integer holding data.
2) Left pointer holding node in a left subtree.
3) Right pointer holding node in a right subtree.

The following design is having data of int type and left,right pointers of a node to the subtrees.

```package com.BST;

public class Node {

int data;
Node left;
Node right;
/**
* @return the data
*/
public Node(int data)
{
this.left=null;
this.right=null;
this.data=data;
}

public int getData() {
return data;
}
/**
* @param data the data to set
*/
public void setData(int data) {
this.data = data;
}
/**
* @return the left
*/
public Node getLeft() {
return left;
}
/**
* @param left the left to set
*/
public void setLeft(Node left) {
this.left = left;
}
/**
* @return the right
*/
public Node getRight() {
return right;
}
/**
* @param right the right to set
*/
public void setRight(Node right) {
this.right = right;
}
* @see java.lang.Object#toString()
*/
@Override
public String toString() {
return "Node [data=" + data + ", left=" + left + ", right=" + right
+ "]";
}

}
```

### Bubble Sort in JAVA

What is bubble sort?

It is a sorting technique that is based on the comparison.Here we compare adjacent element, if the first element is larger than the second we swap each other. We do the same procedure again and again until array do not sort completely.

Example:-
5 1 4 2 8

51428here pass is nothing but iterating the loops equal to number of elements in the array but if it already sorted before then we can break the loop anddo existPASS1 case0 1 //check 0 and first element15428 case1 2 //check 1 and 2 element14528 case2 314258 case3 414258 swap istruePASS2 //first pass completed now do second pass case0 114258 case1 212458 case2 312458 case3 412458 swap istrue PASS3 // third pass case0 112458 case1 212458 case2 312458 case3 412458 swap isfalse since swap is false we break from the loop and do not go for fourth and fifth pass
Program:-

package sorting;publicclassBubbleSort{//function to print arraypublicstaticvoidprint(int[] arr){for(int i=0;i<=arr.length-1;i++) Syst…

### Sorting Implementation in JAVA

Sorting is a technique to order the data in a way such that data will remain in lowest to highest form. There are various techniques involved in sorting data.I have added the implementation of few important sorting techniques. Please click on link to read in detail:-
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort