【剑指offer】面试题32：从上到下打印二叉树

32-I.从上到下打印二叉树

从上到下打印出二叉树的每个节点，同一层的节点按照从左到右的顺序打印。

给定二叉树: [3,9,20,null,null,15,7],
    3
   / \
  9  20
    /  \
   15   7
返回：
[3,9,20,15,7]

BFS

class Solution {
public:
    vector<int> levelOrder(TreeNode* root) {
        vector<int> res;
        if (root == nullptr)
            return res;
        queue<TreeNode*> q;
        q.push(root); //根入队
        while(!q.empty())
        {
            TreeNode* node = q.front();
            q.pop();
            res.push_back(node->val); //出队时记录
            if (node->left)
            {
                q.push(node->left);
            }
            if (node->right)
            {
                q.push(node->right);
            }
        }
        return res;
    }
};

32-II.从上到下打印二叉树II

从上到下按层打印二叉树，同一层的节点按从左到右的顺序打印，每一层打印到一行。

给定二叉树: [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7
返回其层次遍历结果：
[
  [3],
  [9,20],
  [15,7]
]

保存本层和下一层

• 设置tmp和res保存下一层的节点和本层的节点值

• 引申：关于vector的内存释放问题
  方法一：clear

  方法二：vector().swap(nums);

  方法三：利用代码块和临时变量
  { vector tmp = curLevel; curLevel.swap(tmp); }

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> ret;
        vector<int> res;
        if (root == nullptr)
            return ret;
        queue<TreeNode*> q;
        queue<TreeNode*> tmp;
        q.push(root); //根入队
        while(!q.empty())
        {
            TreeNode* node = q.front();
            q.pop();
            res.push_back(node->val); //出队时记录
            if (node->left) 
                tmp.push(node->left);
            if (node->right)
                tmp.push(node->right);
            if(q.empty())
            {
                q = tmp;
                tmp = queue<TreeNode*>();//清空
                ret.push_back(res);
                res.clear();//清空
            }
        }
        return ret;
    }
};

简洁BFS

• 记录每一层的size

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        queue<TreeNode*> q;
        q.push(root);
        vector<vector<int>> res;
        while(q.size())
        {
            int size=q.size();
            vector<int> level;
            for(int i=0;i<size;i++)
            {
                TreeNode* rt=q.front();q.pop();
                if(!rt) continue;
                level.push_back(rt->val);
                if(rt->left) q.push(rt->left);
                if(rt->right) q.push(rt->right);
            }
            if(level.size()!=NULL) res.push_back(level);
        }
        return res;
    }
};

简洁DFS

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> res;
        dfs(root,res,0);
        return res;
    }
    void dfs(TreeNode* root,vector<vector<int>>& res,int level)
    {
        if(!root) return;
        if(level>=res.size()) res.push_back(vector<int>());
        res[level].push_back(root->val);
        dfs(root->left,res,level+1);
        dfs(root->right,res,level+1);
    }
};

32-III.从上到下打印二叉树III

请实现一个函数按照之字形顺序打印二叉树，即第一行按照从左到右的顺序打印，第二层按照从右到左的顺序打印，第三行再按照从左到右的顺序打印，其他行以此类推。

给定二叉树: [3,9,20,null,null,15,7],
		3
   / \
  9  20
    /  \
   15   7
   
返回其层次遍历结果：
[
  [3],
  [20,9],
  [15,7]
]

BFS+reverse

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        queue<TreeNode*> q;
        q.push(root);
        vector<vector<int>> res;
        int flag=0;
        while(q.size())
        {
            int size=q.size();
            vector<int> level;
            for(int i=0;i<size;i++)
            {
                TreeNode* rt=q.front();q.pop();
                if(!rt) continue;
                level.push_back(rt->val);
                if(rt->left) q.push(rt->left);
                if(rt->right) q.push(rt->right);
            }
            if(level.size()!=NULL)
            {
                if(flag==1)
                {
                    reverse(level.begin(),level.end());
                    flag=0;
                }
                else
                    flag=1;
                res.push_back(level);
            }
                
        }
        return res;
    }
};