MrWrong

摘要： PERSISTENT-TREE-INSERT(T,z) y2 = NIL x2 = T2.root = T.root.copy() while x2 != NIL y2 = x2 if z.key < x2.key x2.left = x2.left.copy() //NIL.copy()就是NIL本身 x2 = x2.left else x2.right ... 阅读全文