107. Binary Tree Level Order Traversal II

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).

For example:
Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

return its bottom-up level order traversal as:

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

两种思路 dfs和bfs都可以

dfs

/**

2

 * Definition for a binary tree node.

3

 * struct TreeNode {

4

 *     int val;

5

 *     TreeNode *left;

6

 *     TreeNode *right;

7

 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}

8

 * };

9

 */

10

class Solution {

11

public:

12

    /*vector<vector<int>> levelOrderBottom(TreeNode* root) {

13

        vector<vector<int>>res;

14

       dfs(root,0,res);

15

         reverse(res.begin(), res.end());

16

        return res;

17

    }

18

    vector<vector< int>>& dfs(TreeNode*root,int level,vector<vector<int>> &res)

19

    {

20

        if(root=NULL)

21

            return res;

22

        if(level==res.size())//res存储的上一次所包含的，如果有左右结点，那么下一次的level必定要使res新加一层

23

        {

24

            res.push_back(vector<int>());

25

        }

26

        res[level].push_back(root->val);

27

        dfs(root->left,level+1,res);

28

        dfs(root->right,level+1,res);

29

    }*/

30

​

31

vector<vector<int> > res;

32

​

33

void DFS(TreeNode* root, int level)

34

{

35

    if (root == NULL) return;

36

    if (level == res.size()) // The level does not exist in output

37

    {

38

        res.push_back(vector<int>()); // Create a new level

39

    }

40

41

    res[level].push_back(root->val); // Add the current value to its level

42

    DFS(root->left, level+1); // Go to the next level

43

    DFS(root->right,level+1);

44

}

45

​

46

vector<vector<int> > levelOrderBottom(TreeNode *root) {

47

    DFS(root, 0);

48

    return vector<vector<int> > (res.rbegin(), res.rend());

49

}

50

};

bfs

DFS solution:

public class Solution {
    public List<List<Integer>> levelOrderBottom(TreeNode root) {
        Queue<TreeNode> queue = new LinkedList<TreeNode>();
        List<List<Integer>> wrapList = new LinkedList<List<Integer>>();
        
        if(root == null) return wrapList;
        
        queue.offer(root);
        while(!queue.isEmpty()){
            int levelNum = queue.size();
            List<Integer> subList = new LinkedList<Integer>();
            for(int i=0; i<levelNum; i++) {
                if(queue.peek().left != null) queue.offer(queue.peek().left);
                if(queue.peek().right != null) queue.offer(queue.peek().right);
                subList.add(queue.poll().val);
            }
            wrapList.add(0, subList);
        }
        return wrapList;
    }
}