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

剑指 Offer 32 - I. 从上到下打印二叉树
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> levelOrder(TreeNode* root) {
        vector<int> vi;
        if(root==NULL) return vi;

        queue<TreeNode*> qt;
        qt.push(root);
        while(!qt.empty()) {
            TreeNode *root = qt.front();
            if(root->left != NULL) qt.push(root->left);
            if(root->right != NULL) qt.push(root->right);
            vi.push_back(root->val);
            qt.pop();
        }
        return vi;
    }
};

 

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

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

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        
        vector<vector<int>> vvi;
        if(root==NULL) return vvi;
 
        queue<TreeNode*> qt;
        qt.push(root);
        while(!qt.empty()) {
            int sz = qt.size();
            vector<int> vi;
            for(int i=0;i<sz;i++) {                
                TreeNode *root = qt.front();
                if(root->left != NULL) qt.push(root->left);
                if(root->right != NULL) qt.push(root->right);
                vi.push_back(root->val);
                qt.pop();
            }
            vvi.push_back(vi);
        }
        return vvi;
    }
};