给定一棵二叉树,想象自己站在它的右侧,按照从顶部到底部的顺序,返回从右侧所能看到的节点值。
示例:
输入: [1,2,3,null,5,null,4]
输出: [1, 3, 4]
解释:
1 <—
/
2 3 <—
\
5 4 <—
简单解析:
二叉树的层次遍历,每层添加进去后计数后添加左子节点或右子节点,循环到计数值之后,即为最右节点。
vector<int> rightSideView(TreeNode* root)
{
vector <int>res;
if (root == NULL)
return res;
else
{
queue<TreeNode*> q;
q.push(root);
while (!q.empty())
{
int Q_size = q.size();
for (int i = 0; i < Q_size; i++)
{
TreeNode *temp = q.front();
q.pop();
if (temp->left != NULL)
q.push(temp->left);
if (temp->right != NULL)
q.push(temp->right);
if (i == Q_size-1)
res.push_back(temp->val);
}
}
return res;
}
}
递归
class Solution
{
public:
vector<vector<int>> res;
void Mid_Search_BT(TreeNode* root, int n)
{
if (root == NULL)
return;
else
{
if (n >= res.size())
{
vector<int> temp;
res.push_back(temp);
}
Mid_Search_BT(root->left, n + 1);
res[n].push_back(root->val);
Mid_Search_BT(root->right, n + 1);
}
}
vector<int> rightSideView(TreeNode* root)
{
vector<int> result;
Mid_Search_BT(root, 0);
for (int i = 0; i < res.size(); i++)
result.push_back(res[i][res[i].size() - 1]);
return result;
}
};