java - 如何使用java为二叉搜索树创建深度复制

Question

关闭。此题需要 details or clarity 。目前不接受答案。

---

想要改进这个问题吗？通过 editing this post 添加详细信息并澄清问题.

已关闭 9 年前。

Improve this question

public class BinarySearchTree
{
public class TreeNode       
{   
private int item;
    private TreeNode leftLink;
    private TreeNode rightLink;
// One constructor for TreeNode
///////////////////////////////////////////////////////
    public TreeNode(int newItem, TreeNode left, TreeNode right)
    {
         item      = newItem;
         leftLink  = left;
         rightLink = right;
    }
}   //  End of TreeNode inner class

// Declaration of class BinarySearchTree begins here.
// Three instance variables.
private TreeNode root;
private TreeNode parent;    // parent node of a target node being sought
private int parentLink;     // pointer number of a parent node being sought


public BinarySearchTree( )
{
    root = parent = null;
    parentLink = 0;         // no such pointer at the beginning
}

我想要这棵树的深拷贝，标题应与下面给出的相同，它应该像描述的那样工作，此构造函数将创建一棵二叉搜索树，它是由此构造函数的单独参数给出的现有二叉搜索树的深拷贝。

public BinarySearchTree (BinarySearchTree  bst)
{

  //your code should be here
}
// more codes here but given code is ok for question
}

Answer 1

您可以向 TreeNode 添加一个函数:

public TreeNode deepCopy() {
    return new TreeNode(item, leftLink.deepCopy(), rightLink.deepCopy())
}

然后:

public BinarySearchTree (BinarySearchTree  bst) {
    root = bst.root.deepCopy();
    parent = bst.parent.deepCopy();
    parentLink = bst.parentLink;
}

当然这是一个例子，你应该注意null值。

您可以在这里找到更好的示例:How to deep copy a tree?