Binary Search Tree
Binary Search Tree
class Node {
int data;
Node left, right;
class BinarySearchTree {
Node root;
BinarySearchTree() {
root = null;
}
if (root == null) {
root = new Node(data);
return root;
}
if (data < root.data)
root.left = insert(root.left, data);
else if (data > root.data)
root.right = insert(root.right, data);
return root;
}
void inOrder() {
inOrder(root);
}
void postOrder() {
postOrder(root);
}
void preOrder() {
preOrder(root);
}
tree.insert(10);
tree.insert(20);
tree.insert(30);
tree.insert(40);
tree.insert(50);
}
}