How would you check if a binary tree is BST or not ? Write a program.
- 1 Answers
- 1009 Views
- DELL, I also Faced
- E-Mail Answers
Answer Posted / Sumaira Anam
To check if a binary tree is a BST (Binary Search Tree), you can perform an inorder traversal and check that the current element is greater than its left child and less than its right child. A recursive function can be written to do this. Here's an example of such a program:
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Write a program for Sorting an Array. Which sorting will you prefer?
What sort of serious problems have you experienced, and how have you handled them?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
Can you declare an array without assigning the size of an array?
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.
