- A Consider The Following B Tree Index Where Index Nodes Can Contain Up To Two Keys And Three Pointers And Leaf N 1 (111.46 KiB) Viewed 71 times
(a) Consider the following B$^+$-tree index, where index nodes can contain up to two keys and three pointers, and leaf n
-
correctanswer
- Posts: 43759
- Joined: Sat Aug 07, 2021 7:38 am
(a) Consider the following B$^+$-tree index, where index nodes can contain up to two keys and three pointers, and leaf n
(a) Consider the following B$^+$-tree index, where index nodes can contain up to two keys and three pointers, and leaf nodes can contain up to two data entries: 14 48 19 1* 3* 5* 9* 16* 18* 22* (i) Show the tree after inserting a data entry with the search key value 6. (ii) Starting with your tree from part (i), insert a data entry with the search key value 7. (iii) Start again with the original tree given at the start of this question. Show the tree after deleting the data entry with a search key of 5. (iv) Starting with the tree from part (iii), show the tree after deleting the data entry with a search key of 3. (3+5+3+ 6 = 18 marks)