tree_traversal · www.studyline.ai

Study: Tree Traversal

Flashcards

1 / 2

🌁 Switch to Slideshow

algorithm graph_algorithm graph_traversal tree depth_first breadth_first preorder inorder postorder level_order

🔥 depth first search → Depth-first search is a specific traversal strategy that depends on the general concepts and mechanics of tree traversal—systematic node visitation and backtracking via recursion or a stack—to define its depth-first ordering.

🔥 breadth first search → Breadth-first search instantiates tree traversal with a level-order policy, visiting nodes layer by layer; implementing BFS depends on traversal fundamentals (visit order, systematic expansion of children, and termination) specialized with a queue.

⚡️ queue →

⚡️ recursion →

⚡️ stack →