自制查找方式:堆查找(疑问)

学术版

@[zhangzhixu000001](/user/1210321) first second 有区别吗
by tcy01_QAQ_ @ 2024-04-16 18:17:11


@[tcy01_QAQ_](/user/734379) 有 单搜子树如果左子树没有的话,极端情况下要一直搜到右子树的叶子,所以最坏情况$O(N)$
by zhangzhixu000001 @ 2024-04-16 18:42:07


@[zhangzhixu000001](/user/1210321) 平衡树不就logn的吗
by ___A__ @ 2024-04-16 18:45:12


@[zhangzhixu000001](/user/1210321) 所以有平衡树啊
by tcy01_QAQ_ @ 2024-04-16 18:53:42


6... 原来我做的就是平衡树查找的未优化版
by zhangzhixu000001 @ 2024-04-16 19:00:07


@[zhangzhixu000001](/user/1210321) 那 Splay 不就是均摊 $O(\log N)$ 吗
by lunjiahao @ 2024-04-16 19:04:06


|