Interested to Buy Any Domain ? << Click Here >> for more details...
What are Binay tress and B trees? Diff between them?
- 8 Answers
- 15353 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
Why c++ is not a pure oop language?
What are the advantages of prototyping?
How do you print a string on the printer?
What do you mean by public protected and private in c++?
What is time_t c++?
How do you remove an element from a set in c++?
What is else syntax in c++?
State two differences between C and C++.
What is the arrow operator in c++?
What is the syntax for a for loop?
What is the difference between delegation and implemented-in-terms-of?
What is the history of c++?
What is setf in c++?
What are libraries in c++?
What is the two main roles of operating system?
