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

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

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

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

[
  [3],
  [9,20],
  [15,7]
]
 

提示：

节点总数 <= 1000

//层序遍历 时间复杂度：O(n) 空间复杂度：O(n)
struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    // TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
int n=-1;
//递归建树建树 这里是先序创建 
TreeNode* create(vector<int> tree){
    ++n;
    TreeNode *root;
    if(n>=tree.size()){//终止条件
        return NULL;
    }
    else{
        if(tree[n]==0){//输入为0，表明当前节点为空
            root = nullptr;
            
        }
        else{//否则表明当前节点不为空
            root = new TreeNode;
            root->val = tree[n];
            //返回左子树的根节点地址，赋值给root的左指针
            root->left = create(tree);
            // printf("%d %d\n", n, root->left);
            root->right = create(tree);
            // printf("%d %d\n", n, root->right);  
        }
    }
    return root;
}
//层序遍历树
vector<vector<int> > BFS(TreeNode *root){
    vector<vector<int> > v;
    if(root == nullptr) return v;//加上判断条件判断tree是否为null
    deque<TreeNode*> d;
    d.push_back(root);
    bool leftorright=true;//用于控制是从左到右还是从右向左,第一层是true,第二层是false
    while(!d.empty()){
        int size = d.size();
        vector<int> m;
        for(int i=0; i<size; i++){//依次循环遍历,用于分段加数组
            if(leftorright){
                TreeNode* node = d.front();//从左向右出
                m.push_back(node->val);
                d.pop_front();
                if(node->left != nullptr) d.push_back(node->left); //下一层从右向左出
                if(node->right != nullptr) d.push_back(node->right);  
            }
            else{
                TreeNode* node = d.back();//从右向左出
                m.push_back(node->val);
                d.pop_back();
                if(node->right != nullptr) d.push_front(node->right); //下一层从左向右出
                if(node->left != nullptr) d.push_front(node->left);
            }
        }
        v.push_back(m);
        leftorright = !leftorright;
    }
    return v;
}
int main(){
    vector<int> tree;
    tree.push_back(3);
    tree.push_back(9);
    tree.push_back(0);
    tree.push_back(0);
    tree.push_back(20);
    tree.push_back(15);
    tree.push_back(7);
    TreeNode *root = create(tree);
    vector<vector<int> > v = BFS(root);
    for(int i=0; i<v.size(); i++){
        for(int j=0; j<v[i].size(); j++){
            printf("%d ", v[i][j]);
        } 
    }
    return 0;
}