And finally, no right sibilng can exist without its left sibling. Secondly, in all levels except perhaps the last level, every parent node should exactly have two children. Firstly, the leaf nodes of the tree will be in last level or the level above it. We can infer a couple of things from the above statement. It states that min heap is a complete binary tree, which is a binary tree that is filled at all levels, except perhaps the last level, which is filled from left to right. Min heap is data structure that satisfies two properties : Shape property
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |