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,
1 <—
/ \
2 3 <—
\ \
5 4 <—
You should return [1, 3, 4].
题目是求二叉树的每一层最右边的结点。
解法:BFS,按层遍历,找到每一层最右的结点。
即如果队列中的下一个结点比当年的结点层数大,
则说明当前的结点为最右边的点。
struct Node //重新创建一个带有高度的二叉树结点
{
TreeNode* node;
int level;
Node(TreeNode* t, int l): node(t), level(l) {}
};
class Solution {
public:
vector<int> rightSideView(TreeNode *root) {
vector<int> v;
if(root == NULL) return v;
queue<Node*> q;
Node* tmp = new Node(root,1);
q.push(tmp);
while(!q.empty()){
Node* front = q.front();
q.pop();
if(q.empty() || q.front()->level > front->level)
v.push_back(front->node->val);
if(front->node->left){
Node* t1 = new Node(front->node->left, front->level+1);
q.push(t1);
}
if(front->node->right){
Node* t2 = new Node(front->node->right, front->level+1);
q.push(t2);
}
}
return v;
}
};
对C++的结构体重新构建还是不太熟悉,这个代码是参考别人的写的。
参考:http://www.cnblogs.com/ganganloveu/p/4418065.html