题目地址:
https://leetcode.com/problems/binary-tree-right-side-view/
求一棵二叉树从右向左看的时候每层看到的第一个数。
思路是DFS,直接先序遍历,同一层后遍历到的节点覆盖之前的值。代码如下:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left),
* right(right) {}
* };
*/
class Solution {
public:
vector<int> rightSideView(TreeNode* root) {
vector<int> res;
dfs(0, root, res);
return res;
}
void dfs(int u, TreeNode* cur, vector<int>& res) {
if (!cur) return;
if (u >= res.size()) res.push_back(cur->val);
else res[u] = cur->val;
dfs(u + 1, cur->left, res);
dfs(u + 1, cur->right, res);
}
};
时间复杂度 O ( n ) O(n) O(n),空间 O ( h ) O(h) O(h)。