Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / glibwaresoftsolutions
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
Write a program to print numbers from 1 to 100 without using loop in c?
Was 2000 a leap year?
What are the valid places to have keyword “break”?
ATM machine and railway reservation class/object diagram
Can main () be called recursively?
Why clrscr is used in c?
stripos — Find position of first occurrence of a case- insensitive string int stripos ( char* haystack, char* needle, int offset ) Returns the numeric position of the first occurrence of needle in the haystack string. Note that the needle may be a string of one or more characters. If needle is not found, stripos() will return -1. The function should not make use of any C library function calls.
What are volatile variables in c?
what is ur strangth & weekness
What are the 32 keywords in c?
show how link list can be used to repersent the following polynomial i) 5x+2
What is function in c with example?
What does sizeof int return?
Describe wild pointers in c?
Describe explain how arrays can be passed to a user defined function
