Answer Posted / hr@tgksolutions.com
Data is efficiently stored and retrieved using a binary search tree.
Nodes with keys less than the node's key value can be found in the left sub-tree.
Nodes with keys larger than or equal to the node's key value can be found in the right sub-tree.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is the difference between typedef and #define?
What are void pointers in c?
What is function prototype in c language?
1. Write a function to display the sum of two numbers in the following ways: By using (i) pass by value (ii) pass by address a. function with argument and with return value b. function with argument and without return value c. without argument , with return value d. without argument , without return value Note: Use pass by address.
Explain the ternary tree?
Program to find the sum of digits of a given number until the sum becomes a single digit. (e.g. 12345=>1+2+3+4+5=15=>1+5=6)
What is data structure in c language?
What is a lookup table in c?
Difference between Shallow copy and Deep copy?
What are shell structures used for?
the portion of a computer program within which the definition of the variable remains unchanged a) mode b) module c) scope d) none
What is a nested formula?
How do we declare variables in c?
Q.1 write a program to create binary tree 1 to 16 numbers? Q.2 write a program to creat a binary search tree for the member that is given by user?
Explain what are compound statements?