Explain what a Binary Search Tree is.
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 |
two progs are given. one starts counting frm 0 to MAX and the other stars frm MAX to 0. which one executes fast.
What is pre-emptive data structure and explain it with example?
i want to switch my career from quailty assurance engineering to development kindly guide me from which programming language its better for me to start plz refer some courses or certifications too i have an experience of 1.5 yrs in QA field.Kindly guide me
main() { printf("\n %d %d %d",sizeof('3'),sizeof("3"),sizeof(3)); }
Why is sizeof () an operator and not a function?
how to write optimum code to divide a 50 digit number with a 25 digit number??
What is the difference between i++ and i+1 ?(in terms of memory)
Explain how are 16- and 32-bit numbers stored?
What is array of structure in c?
What is the use of define in c?
What is cohesion in c?
Write a C function to search a number in the given list of numbers. donot use printf and scanf