目录

tournament tree:

loser tree: 


tournament tree:

  1. 删除过程中交替访问沿途节点及其兄弟;
  2. 感觉像n/2路组归并,一轮需要的时间,n轮需要n的时间;

 

loser tree: 

删除过程中只与父节点比较;

参考资料:https://www.iteye.com/blog/kenby-1017532