给你二叉树的根节点 root
,返回其节点值 自底向上的层序遍历 。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
示例 1:
输入:root = [3,9,20,null,null,15,7] 输出:[[15,7],[9,20],[3]]
示例 2:
输入:root = [1] 输出:[[1]]
示例 3:
输入:root = [] 输出:[]
/**
* Definition for a binary tree node.
* function TreeNode(val, left, right) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
*/
/**
* @param {TreeNode} root
* @return {number[][]}
*/
var levelOrderBottom = function (root) {
if (!root) {
return []
}
let res = []
let queue = [root]
while (queue.length) {
let temp = []
let len = queue.length
while (len--) {
let target = queue.shift()
temp.push(target.val)
target.left && queue.push(target.left)
target.right && queue.push(target.right)
}
res.push(temp)
}
let new_arr = []
for (let i = res.length - 1; i >= 0; i--) {
new_arr.push(res[i])
}
return new_arr
};