题解 | #二叉树的中序遍历#

package main

import . "nc_tools"

/*
 * type TreeNode struct {
 *   Val int
 *   Left *TreeNode
 *   Right *TreeNode
 * }
 */

/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 *
 * @param root TreeNode类
 * @return int整型一维数组
 */
func inorderTraversal(root *TreeNode) []int {
	// write code here
	list := Middle(root)
	return list
}

func Middle(root *TreeNode) []int {
	response := make([]int, 0)
	if root == nil {
		return response
	}
	response = append(response, Middle(root.Left)...)
	response = append(response, root.Val)
	response = append(response, Middle(root.Right)...)
	return response
}