层次遍历打印二叉树，用队列实现。 vector<vector<int> > Print(TreeNode* pRoot) { vector<vector<int>> res; //存放结果 if(pRoot == NULL) return res; queue<TreeNode*> q; q.push(pRoot); int flag = 0; //用于判断是否需要反转存储 while(!q.empty()){ int level_size ...