Interested to Buy Any Domain ? << Click Here >> for more details...
What are Binay tress and B trees? Diff between them?
- 8 Answers
- 15159 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 enum class in c++?
Is string data type in c++?
What are the advantages of prototyping?
Explain shallow copy?
How can you create a virtual copy constructor?
What are the different types of comments allowed in c++?
Which one between if-else and switch is more efficient?
What are the benefits of operator overloading?
What is the use of structure in c++?
What is different in C++, compare with unix?
How can a called function determine the number of arguments that have been passed to it?
What is an orthogonal base class in c++?
Evaluate the following expression as C++ would do :8 * 9 + 2 * 5 a) 82 b) 79 c) 370 d) list
How should a contructor handle a failure?
Is linux written in c or c++?
