Please explain briefly

#1

what is time complexity of insertion and searching of trie in case of searching of word length m,it would be O(m)…but in INSERTION??
AND in which question it is used for…

#2

@AMIT_KUMAR
In both cases it will be 0(m)
Trie are used to design autocomplete search functionality

#3

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.