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

1. What is an expert system and where are they needed? 2. What are the major issues involved in building an expert system?

Write down any four applications of queues.            Application of Queue (i)  Queue is used in time sharing system in which programs with the similar priority form a queu

Djikstra's algorithm (named after it is discovered by Dutch computer scientist E.W. Dijkstra) resolves the problem of finding the shortest path through a point in a graph (the sour

Write a program that uses the radix sort to sort 1000 random digits. Print the data before and after the sort. Each sort bucket should be a linked list. At the end of the sort, the

What is the time complexity of Merge sort and Heap sort algorithms? Time complexity of merge sort is O(N log2 N) Time complexity of heap sort is   O(nlog2n)

What is Access Restrictions Structured containers with access restrictions only allow clients to add, remove and examine elements at certain locations in their structure. For

The data structure needed for Breadth First Traversal on a graph is Queue

Define Big Omega notation Big Omega notation (?) : The lower bound for the function 'f' is given by the big omega notation (?). Considering 'g' to be a function from the non-n

Define Complete Binary Tree Complete Binary Tree:- A whole binary tree of depth d is that strictly binary tree all of whose leaves are at level D.