Answer Posted / Sunil Kumar Rajpal

A Binary Search Tree (BST) is a binary tree where each node has at most two children, and the left subtree contains only nodes with keys less than the parent node, while the right subtree contains only nodes with keys greater than the parent node. The time complexity for basic operations such as search, insert, and delete in a balanced BST is O(log n).

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

1038

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

1499

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.

1388

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

1208

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

1280

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

1023