Tree traversal and structure problems — choose a problem to visualize
Trace the Binary Search Tree Iterator algorithm from parsed input through each decision point.
Trace recursive root selection from preorder and subtree boundaries from inorder.
Trace the Count Complete Tree Nodes algorithm from parsed input through each decision point.
Trace the Flatten Binary Tree to Linked List algorithm from parsed input through each decision point.
Trace the recursive swaps that mirror every subtree.
Trace the Lowest Common Ancestor of a Binary Tree algorithm from parsed input through each decision point.
Trace level-order BFS as each completed frontier increments the depth.
Trace the Binary Tree Maximum Path Sum algorithm from parsed input through each decision point.
Trace the Path Sum algorithm from parsed input through each decision point.
Trace the Populating Next Right Pointers II algorithm from parsed input through each decision point.
Trace paired recursive comparisons between two binary trees.
Trace the Sum Root to Leaf Numbers algorithm from parsed input through each decision point.
Trace mirror comparisons between left and right subtrees.