Interested to Buy Any Domain ? << Click Here >> for more details...
What are Binay tress and B trees? Diff between them?
- 8 Answers
- 15354 Views
- CTS, GATE, Wipro, I also Faced
- E-Mail Answers
Answer Posted / nutan
A B-tree is a method of placing and locating files (called
records or keys) in a database when all the data is known
to be on DISK.
A Binary-tree is a method of placing and locating files
(called records or keys) in a database when all the data is
known to be in RAM.
It takes thousands of times longer to access a data element
from hard disk as compared with accessing it from RAM,
because a disk drive has mechanical parts, which read and
write data far more slowly than purely electronic media.
B-trees save time by using nodes with many branches (called
children), compared with binary trees, in which each node
has only two children. When there are many children per
node, a record can be found by passing through fewer nodes
than if there are two children per node.
Depth of a B-tree is smaller as compared to a binary tree
and hence B-tree allows a desired record to be located
faster, assuming all other system parameters are identical.
| Is This Answer Correct ? | 33 Yes | 3 No |
Post New Answer View All Answers
What is constructor in C++?
What is stl containers in c++?
What is const pointer and const reference?
What is function overriding in c++?
Give example of a pure virtual function in c++?
What is the oldest programming language?
Write syntax to define friend functions in C++.
What is a c++ map?
Is string data type in c++?
What is vector pair in c++?
What are the advantages of early binding?
Why should we use null or zero in a program?
What is the size of a vector?
Explain 'this' pointer and what would happen if a pointer is deleted twice?
What is insertion sorting?
