Answer Posted / Anisha

A heap tree is a complete binary tree with the property that the key at each parent node is greater than or equal to (max-heap) or less than (min-heap) its children's keys. Heaps are used in priority queues, Huffman coding, and in sorting algorithms.

Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)

1507

Write a program for Sorting an Array. Which sorting will you prefer?

1048

Can you declare an array without assigning the size of an array?

1224

For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.

1404

What sort of serious problems have you experienced, and how have you handled them?

1033

“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?

1293