題目:
題解:
思路:遞歸,樹的深度遍歷
代碼:
var rightSideView = function (root) {
let res = [];
let arr = [];
dfs(root, 1)
return res;
function dfs(r, h) {
//主要在這,遞歸結束條件
if (r === null) return;
if (!arr[h]) {
arr[h] = r.val
res.push(r.val)
}
r.right && dfs(r.right, h + 1)
r.left && dfs(r.left, h + 1)
}
};