So guys, now we are well versed with the drought in such an algorithm.
And now we know that how M tried in a structure takes the shape as we keep on inserting more routes
into the samurai data structure.
So now let us go through some point of analysis.
So now we know how routine session happens and I am trying to add a structure for every new route that
is inserted.
Do new nodes are created?
And those two new nodes are called daughter nodes and niece nodes.
However, there is an exception where new insert allowed which is directly hanging off the route of
the Amtrak data structure.
In that case, there is only one node created and there is no need, not at all, apart from the route
to the leaf, gives one specific ground.
So this is a tree in which five adults were inserted.
And if you analyze, if you traverse.
So if you analyze, if you walk this tree from the root to any leaf along any branch of the tree, each
spot from the road to the leaf is specific to one route.
All right.
For example, if you follow this path.
Then you will encounter the route 120 8.2.3.4 slash 32.
All right.
If you follow this path, you will encounter the rout in the Leaf, which is 128 to 120 8.0.0 slash
32 and so on.
Only leaf naught contains data.
Internal nodes data is always null, so you can analyze in this entry, all the internal nodes have
data equal to null.
So you can see this is the internal node whose data is now this the internal node whose data is null
whereas.
The data of the leaf node can never be null.
All right.
All internal nodes have exactly two children except Ruud, which can have three children.
So you can analyze that agent on a node.
Exactly.
Has two children.
And apart from that, there are Leif nodes which has no children at all.
And the root node may have one children, two children or three children, depending on whether you
inserted the round whose the starting bit was zero or one or don't care.
There are no half nodes in the tree.
Half nodes are those nodes which have exactly one children.
So you can see there are no half nodes in the tree, but only the out.
Starting with one particular bit that is either zero or one was inserted in the same tried it out structure.
In such a case, the root node would become a half node.
But apart from the root node, no other node in this I'm tried in a structure can be half node.
All right.
Some of the prefix land from root to leaf along any branch is always hard to do.
So we can see.
Let us suppose that we take this branch.
So some of the prefix land, which is eight plus eight plus 16 is 32.
All right.
So you can take any branch and the some of the prefix land from the root to the leaf is always 32 and
the first bit in node's effective prefix can never be a mismatched bit.
So in the round in such an algorithm, you will never encounter a scenario where you would have to split
the node at the very first bit and the effective prefix of and in order them try.
I leave it to your analysis that why it is so all right.