工学类题库 - 答案窝(daanwo.com)-大学作业答案分享平台

问题：

[单选题]What's the amortized complexity in a sufficiently long sequence 用能力工程师程师程师程师 --> href="/gaojiao/gongxue/">工学类 > 问题列表 of accessing k nodes in a splay

答案解析

问题：

[单选题]The node accessed is a right-child, and so is its parent. What should we do for a single splay opera

答案解析

问题：

[单选题]What's the amortized complexity for a single splay operation in Tarjan's algorithm? 按照Tarj

答案解析

问题：

[单选题]A splay tree degenerates into a list. What's its height after accessing the lowest node? 在一棵退化成

答案解析

问题：

[单选题]In Tarjan's algorithm, how many layers are splayed together? Tarjan提出的伸展算法每几层一起伸展？ A1 B2 C3 D4

答案解析

问题：

[单选题]Which operation is executed for each accessed node in a splay tree? 伸展树每次访问过某节点后都会把该节点： Aremoving it

答案解析

问题：

[单选题]Which property of data access is taken advantage of by splay trees? 伸展树利用了实际问题中数据访问的何种特点： Amassivene

答案解析

问题：

[单选题]Choose the sub-tree after applying 3+4 reconstruction to the tree above. 对以上子树进行3+4重构，得到的子树为：

答案解析

问题：

[单选题] The AVL tree above is imblanced because node 13 was just inserted. Which one is the tree after reba

答案解析

问题：

[单选题]What about the case when a node is deleted? 删除节点的情况呢？ Adecreaes by 1 减小1 B remains the same or incre

答案解析

问题：

[单选题]After inserting a node into an AVL tree and rebalancing, the height of the rotated sub-tree AVL树中插入节

答案解析

问题：

[单选题]What about deleting a node? 删除的时间复杂度为 AO(1) BO(lgn) CO(n) DO(nlgn)

答案解析

问题：

[单选题]What about inserting a node? 插入的时间复杂度为 AO(1) BO(lgn) CO(n) DO(nlgn)

答案解析

问题：

[单选题]What is the time complexity for searching in an AVL tree with n nodes? 在包含n个节点的AVL树中进行查找的时间复杂度为 AO(1

答案解析

问题：

[单选题] Given the BST above, what is the result after a zig operation on node 19? 对以上二叉搜索树，以节点19为轴进行一次zig操作

答案解析

问题：

[单选题] Given the BST above, what is the result after a zig operation on node 19? 对以上二叉搜索树，以节点19为轴进行一次zig操作

答案解析

问题：

[单选题]the complexity becomes 在其上进行查找的最坏时间复杂度为 AO(1) BO(lgn) CO(n) D O(nlgn)

答案解析

问题：

[单选题]Given that it's a balanced BST, which of the following holds? 若已知它是平衡二叉搜索树，则n和h满足关系 Ah=O(1) Bh=

答案解析

问题：

[单选题]What is the worst-case time complexity for searching in it? 在其上进行查找的最坏时间复杂度为 AO(1) B O(lgn) CO(n) DO

答案解析

问题：

[单选题]A BST has n nodes and a height of h. Which of the following holds? 二叉搜索树的高度h和节点个数n满足关系 Ah=O(1) Bh=

答案解析

问题：

[单选题] What are the steps for deleting 16? 欲在以上二叉搜索树中删除节点16，可行的方案是： Aremove 16, make 25 the right child o

答案解析

问题：

[填空题] What is the 3rd element we compare to when searching for 14 in the BST above? 在以上二叉搜索树中查找元素14，第3个和1

答案解析

问题：

[填空题]What's the number of distinct BSTs containing nodes {1, 2, 3 ,4}? 包含节点{1,2,3,4}的不同二叉搜索树有多少棵？

答案解析

问题：

[填空题]What's the number of distinct BSTs containing nodes {1, 2, 3 ,4}? 包含节点{1,2,3,4}的不同二叉搜索树有多少棵？

答案解析

问题：

[单选题]Which of the following is a BST? 以下哪项是二叉搜索树?

答案解析

1250

首页

尾页