Search⌘ K

Overview of Trees

Explore the fundamentals of trees, including definitions, properties, and various types such as binary trees, binary search trees, red-black trees, AVL trees, and 2-3 trees. Understand how these structures are defined and their characteristics to prepare effectively for JavaScript coding interviews.

Binary Trees

Definition: A tree where each vertex has two children at most.

Types: Perfect, Full, Complete, Skewed

Total number of nodes: 2(h+1)12^{(h+1)}-1

Total number of leaf nodes: 2hor(n+1)22^{h} or \frac{(n+1)}{2}

Height: log2(n+1)1log_{2}(n+1)-1 ...