将二叉查找树转换成双链表

最新推荐文章于 2024-08-10 17:57:54 发布

原创最新推荐文章于 2024-08-10 17:57:54 发布 · 314 阅读

0 ·

CC 4.0 BY-SA版权

LintCode算法题专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一种将二叉搜索树转换为双向链表的方法。通过递归地进行中序遍历，可以有效地将树节点重新链接形成一个有序的双向链表。文章提供了一个具体的实现方案。

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

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 * Definition for Doubly-ListNode.
 * public class DoublyListNode {
 *     int val;
 *     DoublyListNode next, prev;
 *     DoublyListNode(int val) {
 *         this.val = val;
 *         this.next = this.prev = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root: The root of tree
     * @return: the head of doubly list node
     */
    private DoublyListNode nodeList;
    private DoublyListNode totle;
    public DoublyListNode bstToDoublyList(TreeNode node) {
        // Write your code here
        if (node == null){
            return null;
        }
        //中序遍历
        bstToDoublyList(node.left);
        if (nodeList == null){
            nodeList =  totle = new DoublyListNode(node.val);
        }else{
            DoublyListNode list = new DoublyListNode(node.val);
            list.prev = nodeList;
            nodeList.next = list;
            nodeList = nodeList.next;
        }
        bstToDoublyList(node.right);
        return this.totle;
    }
}