【Leetcode每日一题】2020-09-05 107 二叉树的层次遍历 II - 简单 (Python & C++)

来源：力扣

给定一个二叉树，返回其节点值自底向上的层次遍历。 （即按从叶子节点所在层到根节点所在的层，逐层从左向右遍历）
Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).
例如：
给定二叉树 [3,9,20,null,null,15,7],
  3
  /  \
9   20
  /   \
 15    7
返回其自底向上的层次遍历为：
[
[15,7],
[9,20],
[3]
]

思路：广度优先搜索 BFS

Python:

# Definition for a binary tree node.
class TreeNode(object):
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None
 
def levelOrderBottom(root):
    """
    :type root: TreeNode
    :rtype: List[List[int]]
    """
    levelOrder = list()
    if not root:
        return levelOrder
        
    q = collections.deque([root])
    while q:
        level = list()
        # 这里保存q的长度，因为后边在循环里q的长度会变化
        size = len(q)
        for _ in range(size):
            root = q.popleft()
            level.append(root.val)
            if root.left:
                q.append(root.left)
            if root.right:
                q.append(root.right)
        levelOrder.append(level)
    return levelOrder[::-1]

C++:

// Definition for a binary tree node.
struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

vector<vector<int>> levelOrderBottom(TreeNode* root) {
    vector<vector<int>> levelOrder;
    if (root == nullptr) {
        return levelOrder;
    }
    
	queue<TreeNode*> q;
	q.push(root);
	while (!q.empty()) {
	    vector<int> level;
	    int s = q.size();
	    for (int i = 0; i < s; ++i){
	        TreeNode* root = q.front();
	        level.emplace_back(root->val);
	        q.pop();
	        if (root->left != nullptr) {
	            q.push(root->left);
	        }
	        if (root->right != nullptr) {
	            q.push(root->right);
	        }
	    }
	    levelOrder.emplace_back(level);
	}
	reverse(levelOrder.begin(), levelOrder.end());
	return levelOrder;
}