学堂在线清华大学数据结构(下)(2021春)课后作业题答案
- This is a splay tree. What's the result after inserting a node 1 and p 2021-06-18
- This is a splay tree. What is the result after accessing node v and p 2021-06-18
- Splay trees have larger worst-case time complexity than AVL trees for 2021-06-18
- Splay trees have larger amortized complexity than AVL trees for insert 2021-06-18
- Splay trees are difficult to implement 伸展树相较于AVL树的缺点是它实现 2021-06-18
- Splay trees have large worst-case time complexity for a single operati 2021-06-18
- How does the topology changes when fixing a double red and the uncle n 2021-06-18
- What is a 'double red' in a red-black tree? 在红黑树中,何为双红缺陷: Ath 2021-06-18
- The height wouldn't exceed __ 高度不超过: AO(1) BO(lgn) CO(n) DO(nlgn) 2021-06-18
- In a red-black tree of size n, the black height wouldn't exceed __ 规 2021-06-18
- A red-black tree is equivalent to a B-tree of order __ 红黑树等价于___ 2021-06-18
- The external nodes are 外部节点的颜色是 Ared 红 Bblack 黑 2021-06-18
- The root of a red-black tree is 红黑树的根节点的颜色是 Ared 红 Bblack 2021-06-18
- What's unique about red-black trees compared to AVL trees? 红黑树相比 2021-06-18
- A node in a red-balck tree could be 红黑树节点的颜色有 Ared 红 Bblack 2021-06-18
- The height of a B-tree decreases only when B树高度的减少只会发生于 Ame 2021-06-18
- The underflow of a B-tree happens when B树的下溢发生于: Athe height of 2021-06-18
- Which consequence follows as a B-tree becomes higher? B树高度的增加一 2021-06-18
- What's the 'overflow' for a B-tree? B树的上溢是指: AThe property of a B 2021-06-18
- What's the height of a B-tree of order 128 relative to a corresponding 2021-06-18
- What's the return value for a failed search in a B-tree of order 4? B 2021-06-18
- What's the time complexity for searching in a B-tree of order 4 and si 2021-06-18
- How many children are there for each node in a B-tree of order 4? 4阶B 2021-06-18
- B-trees have small height so as to B树的层数少有助于: Areduce the numbe 2021-06-18
- Why does the memory becomes smaller and smaller? 内存“越来越小”的原 2021-06-18