题解 | #二叉搜索树与双向链表#
二叉搜索树与双向链表
http://www.nowcoder.com/practice/947f6eb80d944a84850b0538bf0ec3a5
pre记录上次的节点，head记录头节点
public class Solution {
TreeNode head = null,pre =null;
public void dfs(TreeNode root){
if(root == null)return;
dfs(root.left);
if(head == null)head = root;
else pre.right = root;
root.left = pre;
pre = root;
dfs(root.right);
}
public TreeNode Convert(TreeNode pRootOfTree) {
if(pRootOfTree == null)return null;
dfs(pRootOfTree);
return head;
}
}
看到专升本+双非硕，我就知道，此事没那么简单
查看8道真题和解析
