0
点赞
收藏
分享

微信扫一扫

二叉查找树_查找前驱节点

萧让听雪 2022-06-14 阅读 67


文章目录

  • ​​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

二叉查找树_查找前驱节点_二叉树


举报

相关推荐

0 条评论