25 lines
463 B
Go
25 lines
463 B
Go
// Package q145 implements a solution for https://leetcode.com/problems/binary-tree-postorder-traversal/
|
|
package q145
|
|
|
|
type TreeNode struct {
|
|
Val int
|
|
Left *TreeNode
|
|
Right *TreeNode
|
|
}
|
|
|
|
func walk(node *TreeNode, ret *[]int) {
|
|
if node == nil {
|
|
return
|
|
}
|
|
walk(node.Left, ret)
|
|
walk(node.Right, ret)
|
|
*ret = append(*ret, node.Val)
|
|
}
|
|
|
|
func postorderTraversal(root *TreeNode) []int {
|
|
ret := []int{}
|
|
walk(root, &ret)
|
|
return ret
|
|
}
|
|
|
|
var _ = postorderTraversal
|