Golang – Preorder Tree Traversal

Golang – Preorder Tree Traversal

Here in this article, we shall discuss steps and different approach of implementing preorder tree traversal. You can get the preorder tree traversal in java in our article Preorder Tree Traversal (DFS) in java. There are two ways, iterative and recursive for preorder tree traversal.We follow below steps for traversal

1) Visit the root.
2) Traverse the left subtree, i.e., call Preorder(left-subtree)
3) Traverse the right subtree, i.e., call Preorder(right-subtree)

Preorder Traversal of above tree is 10, 20, 40, 70, 50, 30, 60

Time Complexity: O(n)

Recursive solution for Preorder Tree Traversal :

Algorithm for recursive solution is

Code for recursive solution

Output

Iterative solution for Preorder Traversal

To implement iterative solution for Preorder Traversal, we will be using Stack data structure. Use “go get github.com/emirpasic/gods/stacks/arraystack” to get stack.

Algorithm for iterative solution is

Code for iterative solution

Output

Stay tuned for more updates and tutorials !!!

Leave a Reply

Your email address will not be published. Required fields are marked *