- For any given Node in a binary Search Tree, the child node to the left is less than the value of the given node and the child node to its right is greater than the given node.
- Binary Search Tree cannot be used to organize and search through numeric data, given the complication that arise with very deep trees.
- The top node of the binary search tree would be an arbitrary number. All the nodes to the left of the top node need to be less than the top node’s number, but they don’t need to ordered in any particular way.
- The smallest numeric value would go in the top most node. The next highest number would go in its left child node, the the next highest number after that would go in its right child node. This pattern would continue until all numeric values were in their own node.
Join our list
Subscribe to our mailing list and get interesting stuff and updates to your email inbox.