what is the time complexity of insertion, deletion and searching in ordered map and as its implementation is not included in the course so do i need to know it or not
Query regarding ordered map
Ordered map or simple map in C++, has insertion, deletion and searching in logarithmic time.
No you do not have to do he implementation of it.
but you should know the what BSTs are.