Assume a hash table is implemented with linear probing. What’sthe worst-case time complexity of inserting a new data item? (n isthe size of data)
Answer
`Hey,
Note: Brother in case of any queries, just comment inbox I would be very happy to assist all your queries
- Insert: O(n) — If all the keys mappedto the same index, we would need to probe over all nelements
Kindly revert for any queries
Thanks.