本文共 746 字，大约阅读时间需要 2 分钟。

/*struct TreeNode {    int val;    struct TreeNode *left;    struct TreeNode *right;    TreeNode(int x) :            val(x), left(NULL), right(NULL) {    }};*/class Solution {
   public:    vector
   
    
      > Print(TreeNode* pRoot) {
           vector
     
      
       > ret;        if (!pRoot) return ret;        queue
       
         q;        q.push(pRoot);        int level = 0;        while (!q.empty()) {
               int sz = q.size();            vector
        
          ans; while (sz--) { TreeNode *node = q.front(); q.pop(); ans.push_back(node->val); if (node->left) q.push(node->left); if (node->right) q.push(node->right); } ++level; if (!(level&1)) // 按位与 reverse(ans.begin(), ans.end()); ret.push_back(ans); } return ret; }};
        
       
      
     
    
   

转载地址：http://ynklf.baihongyu.com/