将搜索二叉树转换成双向链表

最新推荐文章于 2024-08-14 21:25:09 发布

Lee_Wei4939

最新推荐文章于 2024-08-14 21:25:09 发布

阅读量144

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/liwei1205/article/details/78349503

本文介绍了一种将二叉树转换为双向链表的方法。通过递归处理左子树和右子树，然后调整节点之间的连接，使得最终所有节点形成一个双向链表。文章详细展示了转换过程中的节点连接逻辑，并提供了完整的Java实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

/**
 * Created by lxw, liwei4939@126.com on 2017/10/25.
 */
public class convert {

    class Node{
        public int value;
        public Node left;
        public Node right;
        public Node(int data){
            this.value = data;
        }
    }

    public Node convert2(Node head){
        if(head == null)
            return null;
        Node last = process(head);
        head = last.right;
        last.right = null;
        return head;
    }

    public Node process(Node head){
        if(head == null)
            return null;
        Node leftE = process(head.left);
        Node rightE = process(head.rigth);
        Node leftS = leftE != null? leftE.right:null;
        Node rightS = rightE != null? rightE.right:null;
        if(leftE != null && rightE != null){
            leftE.right = head;
            head.left = leftE;
            rigthS.left = head;
            head.right = rightS;
            rightE.left = leftS;
            return rightE;
        } else if(leftE != null){
            head.left = leftE;
            leftE.right = head;
            head.right = leftS;
            return head;
        } else if(rightE != null){
            rightS.left = head;
            head.right = rightS;
            rightE.left = head;
            return rightE;
        } else{
            head.right = head;
            return head;
        }
    }
}