Tree Algorithms

Rebalance AVL tree subtrees using single and double rotations.

Delete a node from a BST handling leaf, 1-child, and 2-child cases.

Remove root element from max-heap and sift down to restore heap property.

Transform an unordered array into a valid max-heap in linear time.

Search for word or prefix character-by-character in a prefix tree.

Insert a new value into a Binary Search Tree maintaining the BST property.

Find a value in a Binary Search Tree.

Traverse left subtree, visit node, traverse right subtree.

Visit every node on a level before going to a lower level.

Traverse left subtree, traverse right subtree, visit node.

Visit node, traverse left subtree, traverse right subtree.

Execute range sum query over segment tree intervals in logarithmic time.

Update a leaf node and propagate sum updates up to the root.

Delete a word from a prefix tree and prune redundant unshared branches.

Build range-query nodes over intervals of an array.

Insert into a heap and bubble upward to restore heap order.

Create character nodes along a word path in a prefix tree.