inorder traversal golang
package main
import "fmt"
type Node struct {
Key int
Left *Node
Right *Node
}
func inorderTraversal(root *Node) {
if root != nil {
inorderTraversal(root.Left)
fmt.Print(root.Key, " ")
inorderTraversal(root.Right)
}
}
func main() {
/*
Example tree:
1
\
2
/
3
*/
root := &Node{Key: 1}
root.Right = &Node{Key: 2}
root.Right.Left = &Node{Key: 3}
fmt.Print("Inorder Traversal: ")
inorderTraversal(root)
}