Trees Algorithms

Ways to visit every node of a tree exactly once. Depending on when you visit, it splits into preorder (root first), inorder (left → root → right, sorted order in a BST), postorder (root last), and level order.

A self-balancing binary search tree that keeps the height difference of every node's left and right subtrees at most 1. After an insert or delete it restores balance with rotations, guaranteeing O(log n) at all times.

A tree for quickly computing range sums, minimums, and the like. Each node owns one interval, handling both point updates and range queries in O(log n) — covering the update weakness of a prefix-sum array.

A prefix tree that stores strings letter by letter along its branches. By sharing common prefixes, it handles autocomplete, dictionaries, and prefix search in O(m) where m is the string length.