LeetCode/Algorithms/BinaryTreeLevelOrderTraversalII.cs at master · codeyu/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53

// Source : https://leetcode.com/problems/binary-tree-level-order-traversal-ii/
// Author : codeyu

// Date   : 5/11/18 6:26:33 PM

/**********************************************************************************
*
*
* 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]
*
* ]
*
*
*
**********************************************************************************/
using System;
using System.Collections.Generic;
using Algorithms.Utils;
namespace Algorithms
{
    public class Solution107
    {
        public static IList<IList<int>> LevelOrderBottom(TreeNode root)
        {
            throw new NotImplementedException();
        }
    }
}