20190608-剑指offer32.2-AcWing-44. 分行从上往下打印二叉树

剑指offer32.2-AcWing-44. 分行从上往下打印二叉树

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

样例

输入如下图所示二叉树[8, 12, 2, null, null, 6, null, 4, null, null, null]
    8
   / \
  12  2
     /
    6
   /
  4

输出：[[8], [12, 2], [6], [4]]

思路：
     用两个数值来记录遍历的现在这一层的节点数，以及下一层的节点数。
C++ code：

/**
 * 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>> printFromTopToBottom(TreeNode* root) {
        if(root == NULL){
            return {};
        }
        vector<vector<int>> res;
        deque<TreeNode*> deque_node;
        deque_node.push_back(root);
        int now_layer_node = 1;
        int next_layer_node = 0;
        vector<int> now_layer_num;
        res.push_back({root->val});
        while(!deque_node.empty()){
            if(deque_node.front()->left){
                now_layer_num.push_back(deque_node.front()->left->val);
                deque_node.push_back(deque_node.front()->left);
                next_layer_node++;
            }
            if(deque_node.front()->right){
                now_layer_num.push_back(deque_node.front()->right->val);
                deque_node.push_back(deque_node.front()->right);
                next_layer_node++;
            }
            deque_node.pop_front();
            now_layer_node--;
            if(now_layer_node == 0 && now_layer_num.size() != 0){
                now_layer_node = next_layer_node;
                next_layer_node = 0;
                res.push_back(now_layer_num);
                now_layer_num.clear();
            }
        }
        return res;
        
    }
};

python code:

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def printFromTopToBottom(self, root):
        """
        :type root: TreeNode
        :rtype: List[List[int]]
        """
        if root == None:
            return []
        res = []
        now_res = []
        q_node = []
        res.append([root.val])
        q_node.append(root)
        now_layer_node = 1
        next_layer_node = 0
        while len(q_node):
            if q_node[0].left:
                now_res.append(q_node[0].left.val)
                q_node.append(q_node[0].left)
                next_layer_node += 1
            if q_node[0].right:
                now_res.append(q_node[0].right.val)
                q_node.append(q_node[0].right)
                next_layer_node += 1 
                
            now_layer_node -= 1
            q_node.remove(q_node[0])
            
            if now_layer_node == 0 and len(now_res) != 0:
                now_layer_node = next_layer_node
                next_layer_node = 0
                res.append(now_res)
                now_res = []
                
        return res