学堂在线清华大学数据结构(下)(2021春)课后作业题答案
- If it would take us a second for a single memory access, how long woul 2021-06-18
- Why does the memory becomes smaller and smaller? 内存“越来越小”的原 2021-06-18
- What's the amortized complexity in a sufficiently long sequence of acc 2021-06-18
- The node accessed is a right-child, and so is its parent. What should 2021-06-18
- What's the amortized complexity for a single splay operation in Tarjan 2021-06-18
- A splay tree degenerates into a list. What's its height after accessin 2021-06-18
- In Tarjan's algorithm, how many layers are splayed together? Tarjan提 2021-06-18
- Which operation is executed for each accessed node in a splay tree? 伸 2021-06-18
- Which property of data access is taken advantage of by splay trees? 伸 2021-06-18
- Choose the sub-tree after applying 3+4 reconstruction to the tree abov 2021-06-18
- The AVL tree above is imblanced because node 13 was just inserted. Wh 2021-06-18
- What about the case when a node is deleted? 删除节点的情况呢? Adecreaes 2021-06-18
- After inserting a node into an AVL tree and rebalancing, the height of 2021-06-18
- What about deleting a node? 删除的时间复杂度为 AO(1) BO(lgn) CO(n) DO( 2021-06-18
- What about inserting a node? 插入的时间复杂度为 AO(1) BO(lgn) CO(n) DO 2021-06-18
- What is the time complexity for searching in an AVL tree with n nodes? 2021-06-18
- Given the BST above, what is the result after a zig operation on node 2021-06-18
- Given the BST above, what is the result after a zig operation on node 2021-06-18
- the complexity becomes 在其上进行查找的最坏时间复杂度为 AO(1) 2021-06-18
- Given that it's a balanced BST, which of the following holds? 若已知它 2021-06-18
- What is the worst-case time complexity for searching in it? 在其上进行 2021-06-18
- A BST has n nodes and a height of h. Which of the following holds? 二 2021-06-18
- What are the steps for deleting 16? 欲在以上二叉搜索树中删除节点16,可 2021-06-18
- What is the 3rd element we compare to when searching for 14 in the BS 2021-06-18
- What's the number of distinct BSTs containing nodes {1, 2, 3 ,4}? 包含 2021-06-18