00:01
So we need to determine whether the following statement is true or false.
00:05
If all of the vertices, except the leaves of a tree t, have n children, in other words, n connections coming down from them, then t is a complete entry.
00:18
By entry, that means every vertex has at most n children.
00:25
So first of all, to check this entry off, this is definitely true.
00:30
If there are at most n children for each vertex, or if there's exactly n children for each vertex, then there's no more than that.
00:41
So that's definitely true.
00:43
But this complete feature here is going to be a big problem.
00:49
And here is a counter example to show that this statement is false.
00:55
In other words, that this doesn't work.
00:58
I want to draw this tree, and the open circles there represent nodes...
