Function inorderTraversal

validate_binary_search_tree_98/solution.go:20–29

(root *TreeNode)

}

func inorderTraversal(root *TreeNode) []int {
	if root == nil {
		return []int{}
	}

	o := inorderTraversal(root.Left)
	o = append(o, root.Val)
	o = append(o, inorderTraversal(root.Right)...)
	return o
}