BinaryTreeInorderTraversal.cs

// Source : https://leetcode.com/problems/binary-tree-inorder-traversal 
// Author : codeyu 
// Date : Thursday, March 9, 2017 11:28:25 PM 

/**********************************************************************************
*
* Given a binary tree, return the inorder traversal of its nodes' values.
* 
* 
* For example:
* Given binary tree [1,null,2,3],
* 
*    1
*     \
*      2
*     /
*    3
* 
* 
* 
* return [1,3,2].
* 
* 
* Note: Recursive solution is trivial, could you do it iteratively?
*
**********************************************************************************/

using System;
using System.Collections.Generic;
using Algorithms.Utils;
namespace Algorithms
{
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left;
 *     public TreeNode right;
 *     public TreeNode(int x) { val = x; }
 * }
 */
public class Solution094 {
    public static IList<int> InorderTraversal(TreeNode root) {
        throw new NotImplementedException("TODO");
    }
}}