Find count of nodes on a specific level of a binary tree (iteratively)

Question

I know how to count nodes on a level of a tree recursively (used tips from this answer https://stackoverflow.com/a/12879973/2663649 ), but I can't form an iterative algorithm, and not sure if I should use stack or pointer array to save previous nodes (to return to root).

score 1 · Accepted Answer · answered Dec 26 '13 at 18:28

1

You can turn your recursive algorithm into an iterative one.
Just use a stack structure where you do the recursion.

answered Dec 26 '13 at 18:28

peter.petrov

38,363
16
94
159

Find count of nodes on a specific level of a binary tree (iteratively)

1 Answers1