GATE CSE 1991 | Question: 14,a

Question

Consider the binary tree in the figure below:

What structure is represented by the binary tree?

Comments

@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?

---

This question should be under topic heap

Answer 1

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

Comments

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.

Answer 2

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..

Answer 3

Complete Binary tree because 

A 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.

reference - http://web.cecs.pdx.edu/~sheard/course/Cs163/Doc/FullvsComplete.html