Slug: tree-diam-01 · Paired reading: Chapter 19
Prompt
fn diameter(root: &Tree) -> i32 — longest path (edge count) between any two
nodes. Accumulate through &mut while returning height.
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 109