What are Binay tress and B trees? Diff between them?
- 8 Answers
- 12522 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 an operator in c++?
How much is c++ certification?
What is the function to call to turn an ascii string into a long?
Why is the function main() special?
What gives the current position of the put pointer?
What is static in c++?
What is the difference between *p++ and (*p)++ ?
Is c or c++ more useful?
What is cout flush?
Evaluate as true or false: !(1 &&0 || !1) a) True b) False c) Invalid statement
What is == in programming?
How is objective c different from c++?
Why do we need pointers?
What is abstraction in c++?
How does com provide language transparency?
