Please enable JavaScript.

Coggle requires JavaScript to display documents.

Trees - Coggle Diagram

- - - - Continue until you find K or a leaf node
    - - If we reach a leaf node without encountering K, then no record exists in the BST whose value is K
- - - - Every vertex has no more than 2 children
      - left child and right child
        
        The binary tree with its root at the left child is the left subtree
        
        Since left and right subtrees are binary trees as well, so it can also be defined recursively
        
        every vertex is larger than all the numbers in its left subtree and smaller than all the numbers in its right (BST)
      - Very useful for efficient access to very large data sets