RecoverBinarySearchTree.cs

// Source : https://leetcode.com/problems/recover-binary-search-tree/ 
// Author : codeyu 
// Date : Thursday, March 9, 2017 11:49:48 PM 

/**********************************************************************************
*
* 
* Two elements of a binary search tree (BST) are swapped by mistake.
* 
* Recover the tree without changing its structure.
* 
* 
* Note:
* A solution using O(n) space is pretty straight forward. Could you devise a constant space solution?
* 
*
**********************************************************************************/

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 Solution099 {
    public static void RecoverTree(TreeNode root) {
        throw new NotImplementedException("TODO");
    }
}}