What are Binay tress and B trees? Diff between them?
- 8 Answers
- 12442 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
Why are pointers not used in c++?
What is the insertion operator and what does it do?
What is a tuple c++?
What do you know about near, far and huge pointer?
What is the fastest c++ compiler?
Is there a c++ certification?
Can create new c++ operators?
What is insertion sorting?
Why is c++ still used?
What is a far pointer? where we use it?
Explain the differences between list x; & list x();.
What is the difference between containment and delegation?
What is a hashmap c++?
What is #include sstream?
What is linked list in c++?
