Question

Binary Search Tree Diagram:

How do you draw the result of adding multiple elements to a binary search tree? Also, how do you know which level a value appears at, which nodes are the ancestor of the value and how many children does a value have.

Thank you! I need help in understanding this.

Answer 1

1. First, we pass a value and create a new node
2. Check if there is a root, if not, set this newly created node to the root node
3. If there is a root node, we create a variable declared “current”, and set its value to the root node
4. If the newly created node.value is smaller than the root node, we will move left
5. We keep comparing this node.value to left nodes.
6. If the value is small enough and we reach a point where there are no more left nodes, we place this item here.
7. If the node.value is greater we repeat the same steps as above except we move along the right.
8. We need the break statements because there is no count step to terminate the while loop