package binarytreepostordertraversal

import . "gitee.com/dllearn/geektime-algorithm-learn/structures"

// 145. 二叉树的后序遍历
// https://leetcode-cn.com/problems/binary-tree-postorder-traversal/

func postorderTraversal(root *TreeNode) []int {
	res := []int{}
	dfs(root, &res)
	return res
}

func dfs(node *TreeNode, res *[]int) {
	if node != nil {
		dfs(node.Left, res)
		dfs(node.Right, res)
		*res = append(*res, node.Val)
	}
	return
}