Trie data structure doubt

#1

here for geting space complexity for tries sir added 26+26^2 and so on so sir take a node as a char and take 1 byte but in trie noda has a hashmap also so the space complexity will increase and can be also greater than when we r using only hashtable for storing urls

#2

@deepakjumani09
yeah it will be slighly more than summation of GP(sum).
but not more than 3*sum.
becuase we are storing char and (pointer in parent that is pointing to this node).

so for each node we will be using 3 byte space(2byte for pointer and 1 byte for char).

so we can say O(3*sum)==O(sum)

#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.