Tree Traversal

Binary Tree Preorder Traversal | LeetCode 144 | Python | Solution

Click here to see the problem on LeetCode. The problem description is pretty straightforward. We have to return all the nodes’ values following the preorder traversal algorithm. I can assume that you have a basic understanding of Tree data structure. Mainly, there are four types of traversing algorithms in Binary Tree. Preorder traversal is one

Binary Tree Preorder Traversal | LeetCode 144 | Python | Solution Read More »

4 Types Of Binary Tree Traversal | Algorithm Implementation | Iterative Way | Code Snippet

The tree is one of the most important data structures in computer science. We are going to see the Python implementation of tree traversals. In this blog, we will see only iterative implementation. Pre Order Traversal In Order Traversal Post Order Traversal Level Order Traversal

4 Types Of Binary Tree Traversal | Algorithm Implementation | Iterative Way | Code Snippet Read More »