声明:只求用最简单的方法通过,不求优化,不喜勿喷
- dfs遍历二叉树,每次带上当前所在层级
- 如果再结果数组里,当前层级还没有数值,则当前层级是第一次出现,把当前节点的值放入数组中
- 之后每次dfs先遍历右子树再遍历左子树
- 优化todo
/**
* 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 rightSideView = function (root) {
let re = [];
let dfs = function (node, level) {
if(!node){
return ;
}
if (re.length <= level) {
re.push(node.val)
}
dfs(node.right, level + 1);
dfs(node.left, level + 1)
}
dfs(root, 0);
return re;
};