摘要：
12.312.3 1 //12.3-1 2 TREE-INSERT(T,z) 3 if root[T]=NIL 4 root[t]=z 5 return; 6 x=root[T] 7 if key(z)<key[x] 8 TREE-INSERT(left[T],z) // here left[T] is a pointer to a tree, for we may modify the content of the tree 9 else10 TREE-INSERT(right[T],z)11 1... 阅读全文
