/*
// Definition for a Node.
class Node {
public int val;
public Node left;
public Node right;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val,Node _left,Node _right) {
val = _val;
left = _left;
right = _right;
}
};
*/
//中序遍历
class Solution {
Node pre,head;
public Node treeToDoublyList(Node root) {
if(root==null)
return null;
dfs(root);
head.left=pre;
pre.right=head;
return head;
}
//中序遍历
public void dfs(Node cur){
if(cur==null)
return;
dfs(cur.left);//左
//System.out.println(root.val);//根
//如果没有前驱就是头节点
if(pre!=null){
pre.right=cur;
}
else{
head=cur;
}
cur.left=pre;
pre=cur;
dfs(cur.right);//右
}
}
剑指offer26 二叉线索转换为循环双向链表
最新推荐文章于 2024-07-14 16:24:46 发布