二叉搜索树与双向链表（Java实现）

一、实现

public class E36ConvertBSTToDeque {
    //将二叉搜索树转化为双向链表

    private static class BinaryTreeNode{
        int value;
        BinaryTreeNode left;
        BinaryTreeNode right;
    }

    private static BinaryTreeNode convertCore(BinaryTreeNode node, BinaryTreeNode lastNode){
        //采用前序遍历顺序构造双向链表,lastNode指向已转化双向链表的尾节点
        if (node.left != null)
            lastNode = convertCore(node.left, lastNode);

        node.left = lastNode;
        if (lastNode != null)
            lastNode.right = node;
        lastNode = node;

        if (node.right != null)
            lastNode = convertCore(node.right, lastNode);

        return lastNode;
    }

    public static BinaryTreeNode convert(BinaryTreeNode root){
        if (root == null)
            return null;
        //获得双向链表的尾节点
        BinaryTreeNode node = convertCore(root, null);
        //逆向寻找头节点
        while(node != null && node.left != null){
            node = node.left;
        }
        return node;
    }
    

二、测试用例

//测试用例
public static void main(String[] args){
    int[] binarySearchTree = {10, 5, 12, 4, 7};
    BinaryTreeNode root = construct(binarySearchTree, 0);
    root = E36ConvertBSTToDeque.convert(root);
    if (root != null) {
        while (root.right!= null) {
            System.out.print(root.value + " ");
            root = root.right;
        }
        while (root != null) {
            System.out.print(root.value + " ");
            root = root.left;
        }
    }
}
//根据从上到下从左至右的二叉树遍历序列重构二叉树，用于测试
private static BinaryTreeNode construct(int[] order, int index){
    if (index >= order.length)
        return null;
    BinaryTreeNode node = new BinaryTreeNode();
    node.value = order[index];
    node.left = construct(order, index * 2 + 1);
    node.right = construct(order, index * 2 + 2);
    return node;
}