Skip to main content
← CoursesInterview PrepModule 2 · Arrays, Strings, Two-PointerTree: lowest common ancestorwrite20 / 100
💬 Discuss🧪 Playground+125 XP
Task
📝 **Task:** Build a tree with root=3, left=(5 with leaves 6, 2), right=1. Call `lca(root, root.left, root.right)`. Print its val. Expected: 3 📋 Implement the function above. Tests run automatically. 💡 **Hint:** Re-read the theory if stuck.

Keep going

✏️ Write your code here
🐍
Loading Python...
First visit only — ~5-10s. Stays cached afterward.
📊 Result
Press Run to see result...
📣 Help someone learn PythonShare this lesson with a friend — the first 15 are free, no signup.Tweet

💬 Discussion

Be the first to ask a question or share a tip.
Sign in to join the discussion. Reading is free.
Loading discussion…