Binary Search Trees

Binary Search Trees

1. Hierarchical structure, non-linear. Each node has a left subtree and a right subtree

   • The root node is the first and upper node. The leaves are nodes without children nodes. This current bubble is an example of a leaf node. And a node is an object that contains an element
   • BST's are used to optimize search and data retrieving in ordered sets.

2. The basic hierarchy of the nodes are Left Child < Current Node < Right Node.

   • The same concept applies for Left subtree < Root Node < Right Subtree
   • Within the hierarchy, this node would be greater than it's root node (The one that starts with "The basic hierarchy..."), which itself is greater than the node to it's left (The one that starts with "The same concept...).