Golang – Inorder Tree Traversal

# Golang – Inorder Tree Traversal

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

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

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

Time Complexity: O(n)

### Recursive solution for Inorder Tree Traversal :

Algorithm for recursive solution is

Code for recursive solution

Output

### Iterative solution for Inorder Traversal

To implement iterative solution for Inorder 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

Output

Stay tuned for more updates and tutorials !!!