Leetcode 199. 二叉树的右视图
2018-07-22 11:17
295 查看
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: vector<int> rightSideView(TreeNode* root) { if(root==NULL) return vector<int>(); vector<int> ret; queue<TreeNode*> q; q.push(root); while(!q.empty()) { int size = q.size(); ret.push_back(q.back()->val); for(int i=0; i<size; ++i) { auto tmp = q.front(); q.pop(); if(tmp->left) { q.push(tmp->left); } if(tmp->right) { q.push(tmp->right); } } } return ret; } };
相关文章推荐
- LeetCode199. 二叉树的右视图
- Leetcode 199 Binary Tree Right Side View 二叉树右视图
- Leetcode 199 Binary Tree Right Side View 二叉树右视图
- 【LeetCode-面试算法经典-Java实现】【199-Binary Tree Right Side View(从右边看二叉树)】
- 【LeetCode-面试算法经典-Java实现】【199-Binary Tree Right Side View(从右边看二叉树)】
- LeetCode 199 Binary Tree Right Side View(二叉树层序遍历)
- Java 二叉树遍历右视图-LeetCode199
- LeetCode 199. Binary Tree Right Side View(二叉树右侧视图)
- 【LeetCode】199. Binary Tree Right Side View-二叉树右视图结点
- 199.leetcode Binary Tree Right Side View(medium)[层次遍历二叉树 队列]
- [LeetCode] Binary Tree Right Side View 二叉树的右侧视图
- [LeetCode] 199. Binary Tree Right Side View 二叉树的右侧视图
- LeetCode 102 Binary Tree Level Order Traversal(二叉树的层级顺序遍历)(*)
- [LeetCode]100. Same Tree--判断二叉树是否相同
- LeetCode-106:Construct Binary Tree from Inorder and Postorder Traversal (利用中序和后序遍历构建二叉树) -- medium
- Leetcode 94 Binary Tree Inorder Traversal 二叉树
- [LeetCode]103. Binary Tree Zigzag Level Order Traversal--二叉树之字形遍历
- 【LeetCode-面试算法经典-Java实现】【111-Minimum Depth of Binary Tree(二叉树的最小深度)】
- LeetCode 96. Unique Binary Search Trees Python Solution, Catalan数 结点数为n的不同形态的二叉树一共有多少种
- LeetCode 145 Binary Tree Postorder Traversal(二叉树的后续遍历)+(二叉树、迭代)