144. 二叉树的前序遍历(javascript)144. Binary Tree Preorder Traversal
94. 二叉树的中序遍历(javascript)94. Binary Tree Inorder Traversal
145. 二叉树的后序遍历(javascript)145. Binary Tree Postorder Traversal
给你一棵二叉树的根节点 root ,返回其节点值的 后序遍历 。
Given the root of a binary tree, return the postorder traversal of its nodes’ values.
示例 1:
输入:root = [1,null,2,3]
输出:[3,2,1]
示例 2:
输入:root = []
输出:[]
示例 3:
输入:root = [1]
输出:[1]
var postorderTraversal = function(root) {
let res = []
var postorder = function (root) {
if(root==null){
return
}
postorder(root.left)
postorder(root.right)
res.push(root.val)
};
postorder(root)
return res
};
leetcode:https://leetcode-cn.com/problems/binary-tree-postorder-traversal/