1 1 vote The best data structures in terms of asymptotic time complexities for performing the following operations respectively areCONCATENATION (A, B): Concatenate all elements of A and B togetherInsert(T, key): Insert key to TDelete (T, key): Delete key from T if presentSearch (T, key): Returns true if key is present in TStack, Binary Search Tree, Sorted Array, Linked ListLinked List, Stack, Binary Search Tree, Sorted ArrayLinked List, Stack, Sorted Array, Binary Search TreeStack, Linked List, Sorted Array, Binary Search Tree Data Structures goclasses2023-iiith-mock-11 goclasses data-structures binary-search-tree one-mark + – GO Classes 897 views answer comment Share Follow Print See 1 comment 1 1 comment reply viral8702 commented Apr 28, 2024 reply Follow flag Do we have to assume here that for deletion pointer is provided? otherwise to search the element to delete it takes O(n) to search. 0 0 replyShare Please log in or register to add a comment.
2 2 votes Linked List allows $O(1)$ concatenation. Stack allows $O(1)$ insertion. Both Sorted Array and Binary Search Tree allow $O(\log n)$ time search but deletion in a sorted array takes $\Omega(n)$ time in the worst case. Correct Answer: B GO Classes answered Apr 14, 2023 GO Classes comment Share Follow See 1 comment 1 1 comment reply Akash1972 commented May 3, 2023 reply Follow flag @GO Classes Sir here you are considering best case time complexity of BST but in the worst case time complexity of BST goes upto O(n) for deletion and search of elements 2 2 replyShare Please log in or register to add a comment.
