C++ 侧面观察二叉树

给定一个二叉树，假设从该二叉树的右侧观察它，将观察到的节点按照从上到下的顺序输出。

#include <vector>
#include<queue>
struct TreeNode
{
 int val;
 TreeNode* left;
 TreeNode* right;
 TreeNode(int x): val(x), left(NULL), right(NULL){}
};
class Solution
{
public:
 Solution() {};
 ~Solution() {};
 std::vector<int> rightSideView(TreeNode* root)
 {
  std::vector<int> view;
  std::queue<std::pair<TreeNode*, int>> Q;
  if (root)
  {
   Q.push(std::make_pair(root,0));
  }
  while (!Q.empty())
  {
   TreeNode * node = Q.front().first;
   int depth = Q.front().second;
   Q.pop();
   if (view.size()==depth)
   {
    view.push_back(node->val);
   }
   else
   {
    view[depth] = node->val;
   }
   if (node->left)
   {
    Q.push(std::make_pair(node->left, depth + 1));
   }
   if (node->right)
   {
    Q.push(std::make_pair(node->right, depth + 1));
   }
  }
  return view;
 }
};
int main()
{
 TreeNode a(1);
 TreeNode b(2);
 TreeNode c(5);
 TreeNode d(3);
 TreeNode e(4);
 TreeNode f(6);
 a.left = &b;
 a.right = &c;
 b.left = &d;
 b.right = &e;
 c.right = &f;
 Solution solve;
 std::vector<int> result = solve.rightSideView(& a);
 for (int i = 0; i < result.size(); i++)
 {
  printf("[%d]",result[i]);
 }
 return 0;
}

运行结果：

[1][5][6]