Sep 22, 2024 · 7 min read · Here we illustrates the implementation of DFS iteratively using stacks. For the recursive implementation of DFS refere this article. Preorder Traversal Problem Given the root of a binary tree, return the preorder traversal of its nodes' values. (link...
Join discussion
Sep 21, 2024 · 6 min read · Introduction Arrays and linked lists are flat structures, whereas a tree is a hierarchical structure. If a tree has only 2 children, then it is called a binary tree. Terminology Root: The head of the tree is called the root node. Leaf node: A n...
Join discussion
May 2, 2023 · 6 min read · preorder = root left right DFS use stack = inorder= left root right postorder = left right root BFS use queue = print each level Graph Used to represent various real-world scenarios such as social networks, transportation systems, and computer netw...
Join discussion