Scribd
Upload
8 views6 pages

B Tree

The document discusses the properties of B-trees, specifically the arrangement of values in left and right subtrees, which are sorted in ascending order. It outlines the maximum and minimum number of keys and children based on the order of the tree, denoted as P. Two examples are provided to illustrate these concepts, with the first example showing an order of 4.

Uploaded by

justice.chitra.v
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
8 views6 pages

B Tree

The document discusses the properties of B-trees, specifically the arrangement of values in left and right subtrees, which are sorted in ascending order. It outlines the maximum and minimum number of keys and children based on the order of the tree, denoted as P. Two examples are provided to illustrate these concepts, with the first example showing an order of 4.

Uploaded by

justice.chitra.v
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 6

B TREE- SOLVED PROBLEMS

 The left sub tree of the node will have lesser values than the
right side of the sub tree. This means that the nodes are also
sorted in ascending order from left to right.

 If order of the tree is P;

 Maximum No.of Keys =P-1

 Minimum No.of Keys = [P/2]-1

 Minimum No.of Children =P/2

 Maximum No.of Children =P

Example 1:

Assume order is 4 ---------------8,9,10,11,15,16,17,18,20,23,12


Example 2

Assume th order 4…….

You might also like