A query on a BST that takes neither maximum nor minimum time

前端 未结 0 1290
走了就别回头了
走了就别回头了 2021-02-10 22:54

No idea if this is better off on MathOverflow.

A dynamic binary search tree (I assume that it can keep the tree strictly balanced, e.g. red-black, also the BST shall have

相关标签:
回答
  • 消灭零回复
提交回复
热议问题