Tree traversal: Difference between revisions

Revision as of 08:15, 26 January 2023

Revision as of 08:18, 26 January 2023

Line 25:

The two most common forms of DFS are:

#: 1. Recursive DFS

#: 2. Iterative DFS

To traverse binary trees with depth-first search, perform the following operations at each node:<ref>[http://www.cise.ufl.edu/~sahni/cop3530/slides/lec216.pdf ''Binary Tree Traversal Methods'']</ref><ref>{{cite web|url=http://www.programmerinterview.com/index.php/data-structures/preorder-traversal-algorithm/|title=Preorder Traversal Algorithm|access-date=2 May 2015}}</ref>