Binary Search Tree

Binary Search Tree

1. How its Organized

   • Binary Tree = 2 children max
   • Anything left of a node is less than it
   • Anything right of a node is greater than it

2. Implementation

   • Using a similar node structure to linked lists (non-contiguous)
     • Upper structure (Tree) only knows of the root
   • Uses recursion to preform insertions and searches
     • This is because any subtree is also a valid BST!
     • Traverses towards desired spot using the predictable rules of the tree

3. Applications

   • Can be used to sort a list, being used as an intermediary step
   • A self-balancing tree can also help store data efficiently itself as well!