BST(Binary Search Tree)

BST is a common-used data structure. It follows “left small, right large” principle, so that we can quickly find particular node in a BST. diffrent from regular BST, which always require us to traverse all the nodes to find a spesific node, BST.

    7
   / \
  4   9
 / \   \
1   5   10