TREE-MINIMUM(x) while x.leftNIL x=x.left return x TREE-SUCCESSOR(x) if x.rightNIL return TREE-MINIMUM(x.right) y = x.p while yNIL and x==y.right x=y y=y.p return y
这道题你会答吗?花几分钟告诉大家答案吧!
扫描二维码,关注牛客网
下载牛客APP,随时随地刷题