Data Structures & Algorithms using JavaScript
/Intermediate
DFS Traversals
Definition
Depth-First Search goes deep into a tree before going wide. The three variations are Pre-Order (Root, Left, Right), In-Order (Left, Root, Right), and Post-Order (Left, Right, Root).
Explain Like I'm New
Walking through a maze by always keeping your hand on the left wall until you hit a dead end, then backing up.
Interactive Coding Challenges
Inorder Traversal (Recursive)
Solution Code
Loading...
Console output will appear here...