Draw a b-tree., Data Structure & Algorithms

Q. Draw a B-tree of order 3 for the sequence of keys written below:

2, 4, 9, 8, 7, 6, 3, 1, 5, 10                                                                                

 

Ans:

The B-tree of order 3 for the following given data:-

2   4     9     8     7     6      3     1     5     10

1177_B tree.png

Posted Date: 7/10/2012 5:08:13 AM | Location : United States







Related Discussions:- Draw a b-tree., Assignment Help, Ask Question on Draw a b-tree., Get Answer, Expert's Help, Draw a b-tree. Discussions

Write discussion on Draw a b-tree.
Your posts are moderated
Related Questions
Q. Describe what do you understand by the term array? How does an array vary from an ordinary variable? How are the arrays represented in the specific memory?

How to measure the algorithm's efficiency? It is logical to examine the algorithm's efficiency as a function of some parameter n showing the algorithm's input size. Instance

Ask question #Minimum 10000 words accepted#

Define Spanning Tree A Spanning Tree of a connected graph is its linked acyclic sub graph (i.e., a tree) that having all the vertices of the graph.

Which sorting algorithms does not have a worst case running time of  O (n 2 ) ? Merge sort

explain collision resloving techniques in hasing

Implement multiple queues in a single dimensional array. Write algorithms for various queue operations for them.

1. A string s is said to be periodic with a period α, if s is α k for some k > 2. (Note that α k is the string formed by concatenating k times.) A DNA sequence s is called a tand

Q. Explain the technique to calculate the address of an element in an array. A  25 × 4  matrix array DATA is stored in memory in 'row-major order'. If base  address is 200 and

algorithm to search a node in linked list