Explanations, pseudocode, an embedded interactive visualization, implementations in JavaScript, Python, Java and Go, complexity and interview variations.
Recursively visits the left subtree, then the node itself, then the right subtree (Left → Root → Right). On a Binary Search Tree this produces the values in sorted order.
Root → Left → Right; used to copy/serialise trees.
Left → Right → Root; used to delete/evaluate trees.
BFS on a tree with a queue, level by level.
1 + max(height(left), height(right)).
Deepest node that has both targets in its subtree.