Tree traversal: Difference between revisions

Revision as of 07:28, 5 March 2025

Revision as of 10:11, 5 March 2025

Line 103:

{{unreferenced section|date=June 2013}}

===Depth-first search implementation===

Below are examples of [[stack (abstract data type)|stack]]-based implementation for pre-order, post-order and in-order traversal in recursive approach (left) as well as iterative approach (right).

Implementations in iterative approach are able to avoid the [[Recursion (computer science)#Recursion versus iteration|drawbacks of recursion]], particularly limitations of stack space and performance issues.