Answer Posted / Atul Gupta

Binary trees can be rotated in three ways: Left Rotation, Right Rotation, and Double Rotations. These rotations are used to maintain the balance of the tree during insertions and deletions.nExample: If we have a simple binary tree with nodes A, B, C, D, E in order (A-B-C-D-E), we can perform Left Rotation on node A by making node B as the new root and attaching subtrees of A to B.n```n An /
B Cn /n D En```

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

1039

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.

1393

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

1209

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

1025

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

1281

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

1500