Trees

Find corresponding node in cloned tree

Find max depth of DOM tree

Collect unique tags in DOM tree

Traverse a binary tree in left-root-right order

Traverse a binary tree in root-left-right order

Traverse a binary tree in left-right-root order

Find longest root-to-leaf path length

Check if a binary tree is mirror-symmetric

Traverse level by level with BFS

Get the nodes visible from the right side

Check if two trees are identical

Flip every node by swapping child pointers

Check if root-to-leaf path sums to target

Count paths with target sum (not necessarily root-to-leaf)

Longest path between any two nodes

Verify BST ordering constraints across all nodes

Find LCA using BST ordering

Use inorder order to get sorted BST values

Build a balanced BST from sorted values