摘要： (今天主要解决了昨天遗留的问题。在上课的论坛上讨论还是很有效的。12.2未结)12.2-1：[代码]12.2-5:If one BST node has two children, then its predecessor is the maximum of its leftsub-tree, and its successor is the minimum of its right sub-tree. The smallestelement has no left child, and the largest one has no right child.12.2-6:Think from 阅读全文