Answer Posted / Deepika Rajwani

A binary tree is a recursive data structure in which each node has at most two children, called the left child and the right child. Here is an example of a simple binary tree:nn```n1n| n-- 2n| n--- 3n| n-- 4n```

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

1508

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

1294

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

1225

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

1035

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

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

1049