Overview of Trees
Explore various types of tree data structures such as binary trees, binary search trees, red-black trees, AVL trees, and 2-3 trees. Understand their key characteristics, node counts, heights, and balancing properties to build a solid foundation for coding interviews.
We'll cover the following...
We'll cover the following...
Binary trees
Definition: A tree where each vertex has two children at most.
Types: Perfect, Full, Complete, and Skewed
Total number of nodes:
Total number of leaf nodes:
Height:
Binary tree
Binary search trees
Definition: Every node has a value greater to all the node values in its left-subtree and has a value less than all the node values in the right-subtree. Mathematically:
...