What are Binay tress and B trees? Diff between them?
- 8 Answers
- 13024 Views
- CTS, GATE, Wipro, I also Faced
- E-Mail Answers
Answer Posted / g.raju
Binary tree is a tree data structure in which each node has
at most two children. Typically the first node is known as
the parent and the child nodes are called left and right.
A B-tree is a tree data structure that keeps data sorted and
allows searches, insertions, deletions, and sequential
access in logarithmic amortized time. The B-tree is a
generalization of a binary search tree in that more than two
paths diverge from a single node. Unlike self-balancing
binary search trees, the B-tree is optimized for systems
that read and write large blocks of data. It is most
commonly used in databases and file systems.
| Is This Answer Correct ? | 3 Yes | 0 No |
Post New Answer View All Answers
What are 2 ways of exporting a function from a dll?
What are files in c++?
Which is best c++ or java?
Explain how to initialize a const data member.
What is the identity function in c++? How is it useful?
Is c++ used anymore?
What is the difference between function overloading and operator overloading?
what are Operators and explain with an example?
What are the various arithmetic operators in c++?
How can a struct in c++ differs from a struct in c?
what is the use of void main() in C++ language?
find the two largest values among the 6 numbers using control structures : do-while,for,if else,nestedif- else ,while. one or two of them.
What are the three forms of cin.get() and what are their differences?
How c functions prevents rework and therefore saves the programers time as wel as length of the code ?
Write a program to add three numbers in C++ utilizing classes.
