Binary Tree Right Side View

最新推荐文章于 2022-09-12 16:33:40 发布

hnu_wan

最新推荐文章于 2022-09-12 16:33:40 发布

阅读量372

点赞数

分类专栏： C++算法题文章标签： Binary Tree Right Si C++ 算法

本文链接：https://blog.csdn.net/hnu_wan/article/details/46961129

版权

C++算法题专栏收录该内容

50 篇文章 0 订阅

订阅专栏

一、题目要求

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].

二、代码实现

 vector<int> rightSideView(TreeNode* root) {
             vector<int> v;
		queue<TreeNode*> que1,que2;
		if(root==NULL)
			return v;
		else
			que1.push(root);
		//
		TreeNode* tmp;
		while(!que1.empty()||!que2.empty())
		{
			if(!que1.empty())
			{
				while(!que1.empty())
				{
					tmp=que1.front();
					if(tmp->left!=NULL)
						que2.push(tmp->left);
					if(tmp->right!=NULL)
						que2.push(tmp->right);
					que1.pop();
				}
				v.push_back(tmp->val);
			}
			else
			{
				while(!que2.empty())
				{
					tmp=que2.front();
					if(tmp->left!=NULL)
						que1.push(tmp->left);
					if(tmp->right!=NULL)
						que1.push(tmp->right);
					que2.pop();
				}
				v.push_back(tmp->val);
			}
		}

		return v;
    }