Class 12 Exam  >  Class 12 Questions  >  Prepare B+ Tree for the following set of key ... Start Learning for Free
Prepare B+ Tree for the following set of key values (2,3,5,7,11,17,19,23,29,31)Assume that the tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that fit one node is four. After creation of B+ tree perform following series of operations: a)Insert 9 b)Insert 10 c)Insert 8 d)Delete 23 e)Delete 19 ?
Most Upvoted Answer
Prepare B+ Tree for the following set of key values (2,3,5,7,11,17,19,...
Creating a B-Tree


  1. Assuming an empty tree, start by inserting the first key value, 2, as the root node.

  2. Insert the next key value, 3, to the right of 2.

  3. Insert 5 as the right child of 3.

  4. Since there are already two children of 3, split 3 into a new node and move the middle key, 3, up to the parent node.

  5. Insert 7 as the right child of the newly created node with 3 as the parent.

  6. Insert 11 to the right of 7.

  7. Since there are already two children of the node with 3 as the parent, split it and move the middle key, 7, up to the parent node.

  8. Insert 17 as the right child of the newly created node with 7 as the parent.

  9. Insert 19 to the right of 17.

  10. Since there are already two children of the node with 7 as the parent, split it and move the middle key, 11, up to the parent node.

  11. Insert 23 as the right child of the newly created node with 11 as the parent.

  12. Insert 29 to the right of 23.

  13. Since there are already two children of the node with 11 as the parent, split it and move the middle key, 17, up to the parent node.

  14. Insert 31 as the right child of the newly created node with 17 as the parent.



Performing Operations on the B-Tree


Inserting 9


  1. Start at the root node, 17.

  2. Since 9 is less than the smallest key, 17, follow the left child pointer to the node with 3 as the parent.

  3. Since there is room in the node with 3 as the parent, insert 9 as the right child of 7.



Inserting 10


  1. Start at the root node, 17.

  2. Since 10 is greater than the smallest key, 17, follow the right child pointer to the node with 11 as the parent.

  3. Since there is room in the node with 11 as the parent, insert 10 as the right child of 11.



Inserting 8


  1. Start at the root node, 17.

  2. Since 8 is less than the smallest key, 17, follow the left child pointer to the node with 3 as the parent.

  3. Since there is no room in the node with 3 as the parent, split
Explore Courses for Class 12 exam
Prepare B+ Tree for the following set of key values (2,3,5,7,11,17,19,23,29,31)Assume that the tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that fit one node is four. After creation of B+ tree perform following series of operations: a)Insert 9 b)Insert 10 c)Insert 8 d)Delete 23 e)Delete 19 ?
Question Description
Prepare B+ Tree for the following set of key values (2,3,5,7,11,17,19,23,29,31)Assume that the tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that fit one node is four. After creation of B+ tree perform following series of operations: a)Insert 9 b)Insert 10 c)Insert 8 d)Delete 23 e)Delete 19 ? for Class 12 2024 is part of Class 12 preparation. The Question and answers have been prepared according to the Class 12 exam syllabus. Information about Prepare B+ Tree for the following set of key values (2,3,5,7,11,17,19,23,29,31)Assume that the tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that fit one node is four. After creation of B+ tree perform following series of operations: a)Insert 9 b)Insert 10 c)Insert 8 d)Delete 23 e)Delete 19 ? covers all topics & solutions for Class 12 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Prepare B+ Tree for the following set of key values (2,3,5,7,11,17,19,23,29,31)Assume that the tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that fit one node is four. After creation of B+ tree perform following series of operations: a)Insert 9 b)Insert 10 c)Insert 8 d)Delete 23 e)Delete 19 ?.
Solutions for Prepare B+ Tree for the following set of key values (2,3,5,7,11,17,19,23,29,31)Assume that the tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that fit one node is four. After creation of B+ tree perform following series of operations: a)Insert 9 b)Insert 10 c)Insert 8 d)Delete 23 e)Delete 19 ? in English & in Hindi are available as part of our courses for Class 12. Download more important topics, notes, lectures and mock test series for Class 12 Exam by signing up for free.
Here you can find the meaning of Prepare B+ Tree for the following set of key values (2,3,5,7,11,17,19,23,29,31)Assume that the tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that fit one node is four. After creation of B+ tree perform following series of operations: a)Insert 9 b)Insert 10 c)Insert 8 d)Delete 23 e)Delete 19 ? defined & explained in the simplest way possible. Besides giving the explanation of Prepare B+ Tree for the following set of key values (2,3,5,7,11,17,19,23,29,31)Assume that the tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that fit one node is four. After creation of B+ tree perform following series of operations: a)Insert 9 b)Insert 10 c)Insert 8 d)Delete 23 e)Delete 19 ?, a detailed solution for Prepare B+ Tree for the following set of key values (2,3,5,7,11,17,19,23,29,31)Assume that the tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that fit one node is four. After creation of B+ tree perform following series of operations: a)Insert 9 b)Insert 10 c)Insert 8 d)Delete 23 e)Delete 19 ? has been provided alongside types of Prepare B+ Tree for the following set of key values (2,3,5,7,11,17,19,23,29,31)Assume that the tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that fit one node is four. After creation of B+ tree perform following series of operations: a)Insert 9 b)Insert 10 c)Insert 8 d)Delete 23 e)Delete 19 ? theory, EduRev gives you an ample number of questions to practice Prepare B+ Tree for the following set of key values (2,3,5,7,11,17,19,23,29,31)Assume that the tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that fit one node is four. After creation of B+ tree perform following series of operations: a)Insert 9 b)Insert 10 c)Insert 8 d)Delete 23 e)Delete 19 ? tests, examples and also practice Class 12 tests.
Explore Courses for Class 12 exam
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev