Data Structure Algorithm, JavaScript, Programming, Software Development, Technology.
strip the starting “i” from those words, and we’ll put them under a new node called “i”. So far, our tree looks like this: (root) --> i |--> ppi |--> ssippi |--> ssissippi Good, but not good enough, we can see that “ssippi” and “ssissippi” have a common prefix. We need to keep going down this tree