Explain what a Binary Search Tree is.
- 3 Answers
- 429 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 union in c?
How do you define a function?
A program to write a number of letters and numbers, such as counting and display
the statement while(i) puts the entire logic in loop. this loop is called a) indefinite loop b) definite loop c) loop syntax wrong d) none of the above
what is the hardware model of CFG( context free grammar)
What is dynamic dispatch in c++?
write a program to display the numbers having digit 9 in the given range from 1 to 100
main() { int a=5; printf(?%d,%d,%d\n?,a,a< <2,a>>2); } Answer: 5,20,1 please explain this code in detail
Under what circumstances does a name clash occur?
program that accepts amount in figures and print that in words
2 Answers Infosys, Lovely Professional University, Wipro,
Explain what is wrong with this statement? Myname = ?robin?;
#include<stdio.h> main() {int i=1;j=1; for(;;) {if(i>5) break; else j+=1; printf("\n%d",j) i+=j; } }
C 
