Which of the following data structure do better job (has lesser time complexity) at searching elements that has a worst-case time complexity of O(n)? Do not account for the cost of building the Data structure in searching cost. a) Linked list with element sorted by value b) Binary tree with no ordering c) Ordered array d) Hast table with bucket, made up of linked list, where linked list have no ordering.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
