Slug: tree-lca-01 · Paired reading: Chapter 19
Prompt
fn lca(root: &Tree, p: i32, q: i32) -> Option<i32> — LCA values in a
binary tree (not necessarily BST) by restructuring recursion: if both
sides find a hit, current node is the answer.
Enter your book access code
The curriculum, drills, tutor, and interviewer mode are for readers of Ace the Rust Interview. The code is printed in the Preface (Companion site access).
Don’t have the book yet? The landing page stays open — purchase unlocks this gym.
intermediate · order 116