What are Binay tress and B trees? Diff between them?
- 8 Answers
- 13021 Views
- CTS, GATE, Wipro, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / 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 |
Answer / shahram
They are NOT same
b-tree is balanced multiway tree.every node may has more
than 2 sub nodes and every leaf can hold more than one element.
| Is This Answer Correct ? | 11 Yes | 0 No |
Answer / b.jansi rani
->B-tree is smaller as compare to a binary tree.
->B-tree used as many nodes.
->B-tree database is "DISK"and Binary tree database is "RAM"
| Is This Answer Correct ? | 8 Yes | 3 No |
Answer / 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 |
Answer / answer and question
binary tree:they are equal level and higher than root tree
means they going to right side.otherwise its lower means left
side
b tree:they must eual
| Is This Answer Correct ? | 0 Yes | 0 No |
Why is c++ not purely object oriented?
What is problem with overriding functions?
Which software is best for programming?
What are the differences between a struct in C and in C++?
What parameter does the constructor to an ofstream object take?
Explain how would you handle a situation where you cannot call the destructor of a local explicitly?
Can we run c program in turbo c++?
What is Memory Alignment?
What is std :: endl?
What is c++ good for?
Write the program form Armstrong no in c++?
What is function overriding?
STL 
