Overview of Trees

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)}-1$

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

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

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,

$K$ ...