/**
* Definition for a binary tree node.
* type TreeNode struct {
* Val int
* Left *TreeNode
* Right *TreeNode
* }
*/
func postorderTraversal(root *TreeNode) []int {
rsp := make([]int, 0)
if nil == root {
return rsp
}
rsp = append(rsp,postorderTraversal(root.Left)...)
rsp = append(rsp,postorderTraversal(root.Right)...)
rsp = append(rsp, root.Val)
return rsp
}
二叉树后序遍历递归实现
最新推荐文章于 2022-10-23 18:53:43 发布