BinaryTreeLevelOrderTraversalII.cs

// 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();
        }
    }
}