Interested to Buy Any Domain ? << Click Here >> for more details...
What are Binay tress and B trees? Diff between them?
- 8 Answers
- 15123 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
How do I use arrays in c++?
What is c++ good for?
What do you mean by early binding?
What are the c++ access specifiers?
What is the identity function in c++? How is it useful?
How do you establish an is-a relationship?
What is function prototyping? What are its advantages?
What header file is needed for exit(); a) stdlib.h b) conio.h c) dos.h
Is swift faster than c++?
What is #include iostream h in c++?
Which operator cannot overload?
What is oops in c++?
Explain function overloading
What is array in c++ pdf?
Will a catch statement catch a derived exception if it is looking for the base class?
