time complexity shoulld be O(64*n) bcoz for every element we will traverse the depth for inserting it and once again traverse the depth for calculating max xor in O notation O(n)
Time complexity
hello @deepakjumani09
when we say that a particular algorithm has time complexity o(N)
Then it means that algorithm execution time will never exceed C*n where c is any arbitrary constant.
so both notations O(64N) and O(N) is telling the same imformation i.e execution will never exceed c*N.
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.