Predecessor 找的是「left subtree中Key最大的node」；. 因此Successor和Predecessor必定不會同時也有兩個child。以圖二(d)為例：. 龜仙人( ... ... <看更多>

I think it's not so much about modifying the tree or implementing any complicated predecessor/successor-finding logic to be able to ... ... <看更多>

Find Predecessor & Successor of a node using two methods (One going up from node, other coming down from root) - pre_succ_from_node.c. ... <看更多>

Sequent seems to connote subsequent more than antecedent. For something more generic, how about Adjacent? ... <看更多>