文章目录
- brief description:
- description from: intruduction to algorithm
brief description:
- if the node x to be find successor has its right subtree,the find the right subtree’s min
- else(the node x do not has it’s right subtree(empty),then we simply go up the tree from x unitl we encounter a node that is the left child of its parent
description from: intruduction to algorithm