题目
FIT1008-FIT1054-FIT2085 Fundamentals of algorithms - S2 2025
单项选择题
Consider that a BST is used to implement the Dictionary ADT. What is the best- and worst-case complexity for the operation 'add'?
选项
A.a. Best: O(Hash) | Worst: O(Hash + N) where N is the number of keys
B.b. Best: O(Hash) | Worst: O(Hash)
C.c. Best: O(Hash + N) where N is the number of keys | Worst: O(Hash)
D.d. Best: O(Hash + N) where N is the number of keys | Worst: O(Hash + N) where N is the number of keys
查看解析
标准答案
Please login to view
思路分析
Question restatement: Consider that a BST is used to implement the Dictionary ADT. What is the best- and worst-case complexity for the operation 'add'?
Option a: Best: O(Hash) | Worst: O(Hash + N) where N is the number of keys
- This option mixes a Hash term with N in the best case, which is inconsistent with using a BST for a dictionary. A BST-based implementation typically does not rely on hashing for the add operation, so the presence of O(Hash) is misleading. The worst case s......Login to view full explanation登录即可查看完整答案
我们收录了全球超50000道考试原题与详细解析,现在登录,立即获得答案。
类似问题
BST_Srch3 Below is a BST When searching for Node 78 which node is visited 4th? Note that this is a BST not an AVL tree. AVL balancing is not a concern.
CC7_03 Create a function that takes in a Binary Search Tree (BST) and a positive integer k, returning the kth largest integer value within the BST. Assume that the BST only contains integer values and that k will always be less than or equal to the total number of nodes in the tree. For this question, duplicate integers are treated as distinct entries. For instance, in a BST with values {5, 7, 7}, the second largest value would be 7—not 5. Each BST node has an integer value, a left child node, and a right child node. A node is a valid BST node only if it adheres to the BST properties: its value is strictly greater than all values of nodes in its left subtree, and less than or equal to all values of nodes in its right subtree. The children nodes are either valid BST nodes themselves or None / null. Sample input: Sample output: 17 Given the following implementation to traverse_reverse_in_order(node, k, tree_data), which test case would fail? It is guaranteed that all the other methods are correctly implemented. The input trees depicted in the DcStrings of test cases are guaranteed to be accurate.
CC7_01 Create a function that takes in a Binary Search Tree (BST) and a positive integer k, returning the kth largest integer value within the BST. Assume that the BST only contains integer values and that k will always be less than or equal to the total number of nodes in the tree. For this question, duplicate integers are treated as distinct entries. For instance, in a BST with values {5, 7, 7}, the second largest value would be 7—not 5. Each BST node has an integer value, a left child node, and a right child node. A node is a valid BST node only if it adheres to the BST properties: its value is strictly greater than all values of nodes in its left subtree, and less than or equal to all values of nodes in its right subtree. The children nodes are either valid BST nodes themselves or None / null. Sample input: Sample output: 17 Given the following implementation to traverse_reverse_in_order(node, k, tree_data), which test case would fail? It is guaranteed that all the other methods are correctly implemented. The input trees depicted in the DcStrings of test cases are guaranteed to be accurate.
BST6, BST_Srch11 Based on our Binary Search Tree search method discussions in our lectures. Below is an algorithm written for BST search. This is not an AVL Tree so balancing is not a concern. What would be the run time complexity on average of this search algorithm written for a BST ? BSTSearch(tree, key) { cur = tree⇢root while (cur is not null) { if (key == cur⇢key) { return cur // Found } else if (key < cur⇢key) { cur = cur⇢left } else { cur = cur⇢right } } return null // Not found }
更多留学生实用工具
希望你的学习变得更简单
加入我们，立即解锁 海量真题 与 独家解析，让复习快人一步！