题解 | #二叉树的后序遍历#
二叉树的后序遍历
https://www.nowcoder.com/practice/1291064f4d5d4bdeaefbf0dd47d78541
package main import . "nc_tools" /* * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */ /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param root TreeNode类 * @return int整型一维数组 */ func postorderTraversal(root *TreeNode) []int { traversal := make([]int, 0) postorderRecursive(root, &traversal) return traversal } func postorderRecursive(node *TreeNode, traversal *[]int) { if node == nil { return } postorderRecursive(node.Left, traversal) postorderRecursive(node.Right, traversal) *traversal = append(*traversal, node.Val) }