Interested to Buy Any Domain ? << Click Here >> for more details...
What are Binay tress and B trees? Diff between them?
- 8 Answers
- 14835 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 an orthogonal base class in c++?
What are c++ templates used for?
What are the sizes and ranges of the basic c++ data types?
Explain selection sorting?
What are the unique features of C++.
Should the this pointer can be used in the constructor?
In int main(int argc, char *argv[]) what is argv[0] a) The first argument passed into the program b) The program name c) You can't define main like that
Explain the difference between struct and class in terms of access modifier.
What is different in C++, compare with unix?
How are the features of c++ different from c?
How does atoi function work?
Will the following program execute?
Difference between inline functions and macros?
Can you be able to identify between straight- through and cross- over cable wiring? And in what case do you use straight- through and cross-over?
Is there a sort function in c++?
