1. Write the time-complexities of operations/methods on data structures that are given below, in big-oh notation-...

  

Transcribed Image Text:

1. Write the time-complexities of operations/methods on data structures that are given below, in big-oh notation- write your answer next to the question. You can assume there are n items stored in each data structure. (10 points) (i) (!!) get(..) in LinkedList class add(..) in ArrayList class. (iii) get(..) in HashSet class. (iv) contains(..) in LinkedList class. (v) contains(..) in ArrayList class (vi) containsKey(..) in HashMap class (vii) (viii) (ix) (x) containsValue(..) in HashMap class push(..) in Stack class adding one item in Heap data structure and preserving the Heap property removing the root in Heap data structure and preserving the Heap property 1. Write the time-complexities of operations/methods on data structures that are given below, in big-oh notation- write your answer next to the question. You can assume there are n items stored in each data structure. (10 points) (i) (!!) get(..) in LinkedList class add(..) in ArrayList class. (iii) get(..) in HashSet class. (iv) contains(..) in LinkedList class. (v) contains(..) in ArrayList class (vi) containsKey(..) in HashMap class (vii) (viii) (ix) (x) containsValue(..) in HashMap class push(..) in Stack class adding one item in Heap data structure and preserving the Heap property removing the root in Heap data structure and preserving the Heap property

Answer rating: 100% (QA)

i get in LinkedList class Time Complexity ON This is because in the worst case scenario you might need to traverse the entire linked list to find the ... View the full answer