Job Hu — Wed, 18 Jul 2007 12:37:00 GMT

把一个二叉排序树(也许不叫�q�个)变�ؓ递增的双向链�?不能够生成额外的�l�点.
eg 6
       / \
      4   8
     / \ / \
    3 5 7 9

3=4=5=6=7=8=9

我的�?

class Node
{
    public Node left;
    public Node right;

    private static Node getLinkListTail(Node head)
    {
        Node result = head;
        if(result==null) return null;
        while(result.right!=null)
        {
            result = result.right;
        }
        return result;
    }

    public static Node flatten(Node root)
    {
        if(root==null) return null;

        Node result = root;

        // A leaf node
        if(root.left==null&&root.right==null) return root;

        //divide-and-conquer
        Node leftSubTreeLinkListHead = flatten(root.left);
        Node rightSubTreeLinkListHead = flatten(root.right);

        //merge
        Node leftSubTreeLinkListTail = getLinkListTail(leftSubTreeLinkListHead);
        root.left = leftSubTreeLinkListTail;
        root.right = rightSubTreeLinkListHead;
        if(leftSubTreeLinkListHead!=null)
        {
            result = leftSubTreeLinkListHead;
            leftSubTreeLinkListTail.right = root;
        }
        if(rightSubTreeLinkListHead!=null) rightSubTreeLinkListHead.left = root;

        return result;
    }
}

Job Hu 2007-07-18 20:37 发表评论

精品无码三级在线观看视频,亚洲影视综合,国产乱码精品