题解 | #二叉树的后序遍历#
二叉树的后序遍历
http://www.nowcoder.com/practice/1291064f4d5d4bdeaefbf0dd47d78541
//golang递归
func postorderTraversal( root *TreeNode ) []int {
// write code here
res:=make([]int,0)
postOrder(&res,root)
return res
}
func postOrder(res *[]int,root *TreeNode){
if root==nil{
return
}
postOrder(res,root.Left)
postOrder(res,root.Right)
*res=append(*res, root.Val)
}
