Skip to interview prep
Apexed

169. Find the inorder and preorder successors of a node in a binary tree (with parent pointers, no threads).

MediumTrees

Technical

Write a solution in JavaScript or Python, add a few test calls that print results and press Run. This is ungraded practice: Run shows output and does not check correctness. Open the Model answer tab to compare. Your code is saved in this browser.

Tab indents · Ctrl/⌘ + Enter runs · Esc then Tab leaves the editor

Press Run to see your program’s output.

Find the inorder and preorder successors of a node in a binary tree (with parent pointers, no threads). — Data structures & algorithms interview question — Apex