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
A binary tree of depth "d" is an almost complete binary tree if  A) Every leaf in the tree is either at level "d" or at level "d-1"  B)  For any node "n" in the tree with a

CMY Model  The cyan, magenta, yellow (CMY) colour model is a subtractive model based on the colour absorption properties of paints and inks. As such it has become the standard

Easy algorithm for beginner for quicksort with explanation

A graph is a mathematical structure giving of a set of vertexes (v1, v2, v3) and a group of edges (e1, e2, e3). An edge is a set of vertexes. The two vertexes are named the edge en

What is Algorithm A finite sequence of steps for accomplishing some computational task. An algorithm should Have steps which are simple and definite enough to be done

Normally a potential y satisfies y r = 0 and 0 ³ y w - c vw -y v . Given an integer K³0, define a K-potential to be an array y that satisfies yr = 0 and K ³ y w - c vw -y v

Write an algorithm to print all even numbers in descending order and draw the flowchart

This notation gives an upper bound for a function to within a constant factor. Given Figure illustrates the plot of f(n) = O(g(n)) depend on big O notation. We write f(n) = O(g(n))

I need to know about data structure and algorithms. can you help me?

memory address of any element of lower left triangular sparse matrix