What is the recursion space for inorder traversal?
Practice this question from Binary Tree Traversals - DFS recursion Pattern Practice Quiz, with options and an explanation.
Question
What is the recursion space for inorder traversal?
Option A — Correct answer
O(h)
Option B
O(1) always
Option C
O(n^2)
Option D
O(log log n)
Explanation
The recursion stack uses O(h), where h is tree height.