Skip to interview prep
Apexed

148. Compute the size and the height of a binary tree, recursively and iteratively.

EasyTrees

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.

Compute the size and the height of a binary tree, recursively and iteratively. — Data structures & algorithms interview question — Apexed