🏎️ Fast What mistake have you learned most from?

🌊 Zero Two this feels like an interview question lol

Ice given 2 nodes on a binary tree, return the lowest common ancestor in O(N) time

🌊 Zero Two take one node, go up to root, take the other node go up to root or until u hit one u already seen.

Ice true, but only if child nodes have references to parent nodes. otherwise you'd need a top-down recursive approach where you return if the current node is the one of the child nodes in the callback

🏎️ Fast you're hired!