2,578 views

Consider the binary tree in the figure below:

What structure is represented by the binary tree?

Is this a complete binary tree or almost complete binary tree??  For node 25 there is no left child...
@garl

Almost complete BT as in complete BT nodes should be as right as possible and all levels filled except the last one.
@gari yeah it should to left of 25..in almost complete binary tree a node can have one child only in last level and in last level nodes must be filled from left to right..
but this is not a complete binary tree right?

### Subscribe to GO Classes for GATE CSE 2022

This is min-heap. It is obvious looking at the tree.
We cant use binary search as it is a heap.

@idontknowwho

This is not a min heap as the tree is not complete . 27 should be on left . Then the answer holds

edited by
A min heap is almost complete binary tree. This is not a min heap as it is  not almost complete.
This is not a min heap. Leaves should be filled from left to right. If 27 were a left child, then this tree would be min heap. Write this tree as an array and use formula (2i + 2) for 25’s right child index. You won’t get 27 as answer but this tree has 27 as right child. (Assuming indices start from 0 and i is 25’s index)
yes. corected
See, this is a heap only

27 is the left child

Due to space issue, the image is misleading, but its your responsibility to assume it almost complete

The tree is a min heap only
Unless someone has an original image from the 1991 paper, I can’t comment more. From the question’s image, 27 is definitely the right child.
a. Complete Binary Tree
c.
let Node A has to b deleted.
1. Find deppest node as well as selection of deepest node which preserve structure..
2. overwrite A data with deepest node  data.
3. delete deepest node.

b. finding deepest node is crucial here .. in this case 5 will be overwritten by 27.. then delete 27..

Complete Binary tree because

complete binary tree is abinary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.