Explain what a Binary Search Tree is.

Answer Posted / hr@tgksolutions.com

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


Please Help Members By Posting Answers For Below Questions

What is define directive?

848


Is sizeof a keyword in c?

751


Why is c fast?

786


How #define works?

833


What are external variables in c?

766


main() { printf("hello"); fork(); }

933


What is a char c?

786


What is the default value of local and global variables in c?

750


Can a variable be both static and volatile in c?

793


What is the best way of making my program efficient?

759


What does p mean in physics?

794


Explain how can I prevent another program from modifying part of a file that I am modifying?

851


a value that does not change during program execution a) variabe b) argument c) parameter d) none

955


What is the size of enum in bytes?

781


Is main a keyword in c?

822