a simple java solution
二叉搜索树与双向链表
http://www.nowcoder.com/questionTerminal/947f6eb80d944a84850b0538bf0ec3a5
public class Solution {
TreeNode pre=null;
public TreeNode Convert(TreeNode pRootOfTree) {
if(pRootOfTree==null)
return null;
Convert(pRootOfTree.right);
if(pre==null)
pre=pRootOfTree;
else{
pRootOfTree.right=pre;
pre.left=pRootOfTree;
pre=pRootOfTree;
}
Convert(pRootOfTree.left);
return pre;
}
}