Inorder Traversal in binary tree.

binary_inorder_traversal_recursive.go

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func inorderTraversal(root *TreeNode) []int {
    var result []int
    
    if root == nil {
        return result
    }

    left := inorderTraversal(root.Left)
    result = append(result, left...)
    
    result = append(result, root.Val)
    
    right := inorderTraversal(root.Right)
    result = append(result, right...)
    
    return result
}