Tree Laboratory (TR)
Visualize DFS preorder, inorder, and postorder traversals, query segment tree interval splits, update Fenwick prefix ranges, find LCA binary liftings, and calculate tree diameter bounds.
All Tree Utilities (12)
Tree Traversals
Explore preorder, inorder, postorder, and level-order traversal lists.
Binary Search Tree
Insert, delete, and lookup keys dynamically in binary search hierarchies.
AVL Tree
Build self-balancing binary search trees using LL, RR, LR, and RL rotations.
Binary Heap
Interact with Min/Max heaps, monitoring point insertions and bubble swap steps.
Segment Tree
Query range sums and apply point updates over contiguous segment splits.
Lazy Segment Tree
Apply logarithmic range additions and trace deferred tag propagation steps.
Fenwick Tree
Compute prefix sums using LSB bitwise operations and point updates.
Trie (Prefix Tree)
Insert, delete, and trace string prefixes dynamically in char trees.
Lowest Common Ancestor
Query lowest common ancestors on trees using binary lifting tables.
Euler Tour DFS
Flatten tree hierarchies into 1D arrays with subtree entry/exit times.
Tree Diameter
Compute maximum path lengths in tree networks utilizing dual DFS sweeps.
Centroid Decomposition
Decompose tree topologies recursively into logarithmic height centroid trees.