Adding a value to BST can be divided into two stages: Let us see these stages in more detail. Search for a place At this stage analgorithm should follow binary search tree property.

recursion - java-recursive binary search tree - Stack Overflow

If a new value is less, than the current node's value, go to the left subtree, else go to the right subtree. Following this simple rule, the algorithm reaches a node, which has no left or right subtree.

By the moment a place for insertion is found, we can say for sure, that a new value has no duplicate in the tree. Initially, a new node has no children, so it is a leaf. Let us see it at the picture.

Gray circles indicate possible places for a new node. Now, let's go down to algorithm itself. Here and in almost every operation on BST recursion is utilized. Starting from the root, check, whether value in current node and a new value are equal. If so, duplicate is found.

Binary Search Tree | Set 1 (Search and Insertion) - GeeksforGeeks

Otherwise, if a new value is less, than the node's value: Just before code snippets, let us have a look on the example, demonstrating a case of insertion in the binary search tree. The only the difference, between the algorithm above and the real routine is that first we should check, if a root exists.

If not, just create it and don't run a common algorithm for this special case. This can be done in the BinarySearchTree class.

Principal algorithm is implemented in the BSTNode class. Please, consider making a donation. Contribute to help us keep sharing free knowledge and write new tutorials.

BINARY SEARCH TREE :: INSERTION ALGORITHM (Java, C++) | Algorithms and Data Structures

Support us to write more tutorials to create new visualizers to keep sharing free knowledge for you every dollar helps. Get affordable programming homework help. Internal representation of a BST Next: Search for a value in BST. Contribute to AlgoList Liked this tutorial?

Algorithms and Data Structures. Adding a value Adding a value to BST can be divided into two stages: Example Insert 4 to the tree, shown above. Code snippets The only the difference, between the algorithm above and the real routine is that first we should check, if a root exists. Theory Aho, Ullman, Hopcroft. Data Structures and Algorithms. Data Structures and Algorithms in Java.

Practice Mark Allen Weiss. Internal representation of a BST.