sir the ordered map if internally it is stored as BST Than how is update and insert operation O(1) it can be O(logN) or O(N) isnt it??
Sir doubt in ordered map
hello @tejasddongare
ordered map is implemented using balanced bst .
so to perform insertion,deletion,updation it always takes O(log(n) ) time.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.