二叉搜索樹中有兩個位置錯位了，須要從新修正

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

>>阅读原文<<