How do you insert a new item in a binary search tree?
- 1 Answers
- 1052 Views
- I also Faced
- E-Mail Answers
Answer Posted / Santosh Shaw
To insert a new item into a binary search tree, follow these steps:
1. Perform an initial search to find the appropriate location for the new node.
2. If the searched location is null (empty), create a new node with the input value and assign it to that location.
3. If the searched location already contains a value, compare the input value with the current value. If the input value is less than the current value, repeat the search process on the left subtree. Otherwise, repeat the search process on the right subtree.
| 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?
What sort of serious problems have you experienced, and how have you handled them?
Can you declare an array without assigning the size of an array?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
Write a program for Sorting an Array. Which sorting will you prefer?
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.
