Explain what a Binary Search Tree is.
- 3 Answers
- 343 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 |
What is the advantage of an array over individual variables?
By using C language input a date into it and if it is right?
What are pointers in C? Give an example where to illustrate their significance.
What is pointer to pointer in c with example?
What is scope and lifetime of a variable in c?
Is c still used?
Explain what is the advantage of a random access file?
What is the difference between null pointer and void pointer
10 Answers CTS, Manforce, MAQ Software,
What is the difference between near, far and huge pointers?
WHAT IS ABSTRACT DATA TYPE
Can we change the value of #define in c?
What is external variable in c?
C 
