LeetCode OJ Binary Tree Right Side View
2015-04-04 07:19
288 查看
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
For example:
Given the following binary tree,
You should return
Credits:
Special thanks to @amrsaqr for adding this problem and creating all test cases.
直接优先右遍历即可,更新最大高度。
For example:
Given the following binary tree,
1 <--- / \ 2 3 <--- \ \ 5 4 <---
You should return
[1, 3, 4].
Credits:
Special thanks to @amrsaqr for adding this problem and creating all test cases.
直接优先右遍历即可,更新最大高度。
class Solution { public: int depth; vector<int> ans; vector<int> rightSideView(TreeNode * root) { depth = -1; ans.clear(); RL(root, 0); return ans; } void RL(TreeNode * now, int nowDepth) { if (!now) return; if (nowDepth > depth) ans.push_back(now->val), depth = nowDepth; RL(now->right, nowDepth + 1); RL(now->left, nowDepth + 1); } };
相关文章推荐
- Binary Tree Right Side View--LeetCode
- [leetcode]Binary Tree Right Side View
- Leetcode Binary Tree Right Side View
- Leetcode 199 Binary Tree Right Side View
- leetCode 101/199-Symmetric Tree/Binary Tree Right Side View
- Leetcode: Binary Tree Right Side View
- leetcode 日经贴,Cpp code -Binary Tree Right Side View
- [LeetCode]Binary Tree Right Side View
- 199. Binary Tree Right Side View Leetcode Python
- [LeetCode] Binary Tree Right Side View 二叉树的右侧视图
- [Leetcode] Binary Tree Right Side View
- leetcode-199 Binary Tree Right Side View
- 【LeetCode】Binary Tree Right Side View 解题报告
- 199 Binary Tree Right Side View-LeetCode
- [LeetCode] Binary Tree Right Side View
- [LeetCode]Binary Tree Right Side View
- LeetCode: Binary Tree Right Side View
- LeetCode:Binary Tree Right Side View
- [JAVA]LeetCode199 Binary Tree Right Side View
- LeetCode "Binary Tree Right Side View"