Explain what a Binary Search Tree is.
- 3 Answers
- 1168 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / nashiinformaticssolutions
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 |
Answer / 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 |
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 |
In C language, a variable name cannot contain?
Why do we need volatile in c?
what is a static function
What will the code below print when it is executed? int x = 3, y = 4; if (x = 4) y = 5; else y = 2; printf ("x=%d, y=%d ",x,y);
What is multidimensional arrays
How can I find out if there are characters available for reading?
progrem to generate the following series 1 12 123 1234 12345
Where we use clrscr in c?
How many header files are in c?
What is a rvalue?
What is an auto keyword in c?
Explain how do you determine whether to use a stream function or a low-level function?
C 
