Is there a difference between perfect, full and complete tree? Or are these the same words to describe the same situation?
Asked By : John Swoon
Answered By : Yuval Filmus
These words don't have a standard definition. A full binary tree could be one in which every node has either none or two children. A complete binary tree of height $h$ could be one in which all nodes up to level $h$ have two children. I have never heard of the adjective perfect used to describe trees.
That said, a complete binary tree of height $h$ usually means what I wrote above.
Best Answer from StackOverflow
Question Source : http://cs.stackexchange.com/questions/32397
0 comments:
Post a Comment
Let us know your responses and feedback