从上往下打印二叉树

从上往下打印出二叉树的每个节点，同层节点从左至右打印

/* struct TreeNode {      int val;      struct TreeNode *left;      struct TreeNode *right;      TreeNode(int x) :              val(x), left(NULL), right(NULL) {      } };*/ class Solution { public :      vector< int > PrintFromTopToBottom(TreeNode *root) {            vector< int >  ans;            queue<TreeNode*>  q;            if (root==NULL)   return ans;            q.push(root);            TreeNode *node;            while (!q.empty())            {                node=q.front();                ans.push_back(node->val);                q.pop();                if (node->left)                   q.push(node->left);                if (node->right)                    q.push(node->right);            }          return ans;      } };

• 添加笔记