Function inorderTraverse

symmetric_tree_101/solution.go:57–64

(root *TreeNode, a []int)

}

func inorderTraverse(root *TreeNode, a []int) []int {
	if root == nil {
		return a
	}

	a = append(inorderTraverse(root.Left, a), root.Val)
	return inorderTraverse(root.Right, a[:])
}