Answer Posted / Kuvar Sen

1. Inefficient for random access due to the non-contiguous memory allocation of nodes
2. Insertion and deletion operations can be slower because the tree needs to be rebalanced after inserting or deleting a node, especially in AVL trees or red-black trees
3. More memory is required compared to array-based representation due to the overhead for storing pointers

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

1049

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

1295

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

1035

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

1508

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.

1406

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

1225