What are Binay tress and B trees? Diff between them?
- 8 Answers
- 12479 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 is the latest version on c++?
What is private public protected in c++?
What's the order in which the objects in an array are destructed?
Mention the storage classes in c++.
Explain how an exception handler is defined and invoked in a Program.
What is iterator c++?
What does new do in c++?
Why do we use vector in c++?
How are pointers type-cast?
If you don’t declare a return value, what type of return value is assumed?
What are the advantage of using register variables?
What is flush c++?
Is oops and c++ same?
What is double in c++?
What is the difference between C and CPP?
