What are Binay tress and B trees? Diff between them?
- 8 Answers
- 13017 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 and destructor in c++?
Why do we use setw in c++?
What is a flag in c++?
What is the use of "new" operator?
Write about a nested class and mention its use?
Is dev c++ free?
Write a single instruction that will store an EVEN random integer between 54 and 212 inclusive in the variable myran. (NOTE only generate EVEN random numbers)
Describe public access specifiers?
What is the difference between struct and class?
State two differences between C and C++.
How do you remove an element from a set in c++?
Which sort is best for the set: 1 2 3 5 4 a) Quick Sort b) Bubble Sort c) Merge Sort
What is the use of register keyword with the variables?
What is a map in c++?
What is malloc in c++?
