Monday, January 29, 2018

Complete binary in DSA

          A complete binary tree is a tree that is completely filled, with the possible exception of the bottom level. The bottom level is filled from left to right.

         A binary tree T with n levels is complete if all levels except possibly the last are completely full, and the last level has all its nodes to the left side. A perfectly complete binary tree has all the leaf nodes. In the complete binary tree, all the nodes have left and right child nodes except the bottom level. At the bottom level, you will find the nodes from left to right. The bottom level may not be completely filled, depicting that the tree is not a perfectly complete one.
Previous Post
Next Post
Related Posts

0 comments: