title
5.29 B+ Tree Insertion | B+ Tree Creation example | Data Structure Tutorials

description
Learn how to insert data in B+ Tree of order 4. Step by step instructions showing the insertion process in b+ tree DSA Full Course: https: https://www.youtube.com/playlist?list=PLdo5W4Nhv31bbKJzrsKfMpo_grxuLl8LU ****************************************** See Complete Playlists: C Programming Course: https://www.youtube.com/playlist?list=PLdo5W4Nhv31a8UcMN9-35ghv8qyFWD9_S C++ Programming: https://www.youtube.com/playlist?list=PLdo5W4Nhv31YU5Wx1dopka58teWP9aCee Python Full Course: https://www.youtube.com/playlist?list=PLdo5W4Nhv31bZSiqiOL5ta39vSnBxpOPT Printing Pattern in C: https://www.youtube.com/playlist?list=PLdo5W4Nhv31Yu1igxTE2x0aeShbKtVcCy DAA Course: https://www.youtube.com/playlist?list=PLdo5W4Nhv31ZTn2P9vF02bkb3SC8uiUUn Placement Series: https://www.youtube.com/playlist?list=PLdo5W4Nhv31YvlDpJhvOYbM9Ap8UypgEy Dynamic Programming: https://www.youtube.com/playlist?list=PLdo5W4Nhv31aBrJE1WS4MR9LRfbmZrAQu Operating Systems: //www.youtube.com/playlist?list=PLdo5W4Nhv31a5ucW_S1K3-x6ztBRD-PNa DBMS: https://www.youtube.com/playlist?list=PLdo5W4Nhv31b33kF46f9aFjoJPOkdlsRc ************************************************ Connect & Contact Me: Facebook: https://www.facebook.com/Jennys-Lectures-CSIT-Netjrf-316814368950701/ Quora: https://www.quora.com/profile/Jayanti-Khatri-Lamba Instagram: https://www.instagram.com/jayantikhatrilamba/

detail
{'title': '5.29 B+ Tree Insertion | B+ Tree Creation example | Data Structure Tutorials', 'heatmap': [{'end': 860.16, 'start': 812.468, 'weight': 0.824}], 'summary': 'Tutorial discusses b+ tree properties, differences from b tree, and insertion process, demonstrating node splitting, maximum capacity, and examples of inserting specific values into b+ and binary trees.', 'chapters': [{'end': 317.039, 'segs': [{'end': 96.513, 'src': 'embed', 'start': 0.129, 'weight': 0, 'content': [{'end': 6.791, 'text': 'if order is given of a tree, then maximum children would be same as the order given M.', 'start': 0.129, 'duration': 6.662}, {'end': 8.912, 'text': 'minimum children would be M by 2 ceiling.', 'start': 6.791, 'duration': 2.121}, {'end': 16.515, 'text': 'maximum keys would be M minus 1 and minimum keys would be M by 2 ceiling minus 1, right.', 'start': 8.912, 'duration': 7.603}, {'end': 18.275, 'text': 'so here I am going to take this example.', 'start': 16.515, 'duration': 1.76}, {'end': 19.276, 'text': 'order is 4.', 'start': 18.275, 'duration': 1.001}, {'end': 22.477, 'text': 'so here maximum children can be 4.', 'start': 19.276, 'duration': 3.201}, {'end': 24.418, 'text': 'right, minimum children can be 2.', 'start': 22.477, 'duration': 1.941}, {'end': 29.579, 'text': 'maximum keys can be 3 and minimum keys can be 1, except root node.', 'start': 24.418, 'duration': 5.161}, {'end': 32.299, 'text': 'see, these rules are not applied on root node.', 'start': 29.579, 'duration': 2.72}, {'end': 35.201, 'text': 'root node can have maybe two children.', 'start': 32.299, 'duration': 2.902}, {'end': 36.561, 'text': 'root node can have zero.', 'start': 35.201, 'duration': 1.36}, {'end': 39.622, 'text': 'child root node can have one key like that.', 'start': 36.561, 'duration': 3.061}, {'end': 46.284, 'text': 'now the one main important property of b plus tree is what in b plus tree, the data.', 'start': 39.622, 'duration': 6.662}, {'end': 62.281, 'text': 'see this, given data, this data is stored only in leaf nodes, right, and in btree data is stored in leaf node as well as in internal nodes.', 'start': 46.284, 'duration': 15.997}, {'end': 66.804, 'text': 'but here the data is stored only in leaf node.', 'start': 62.281, 'duration': 4.523}, {'end': 69.505, 'text': 'now what is stored in internal nodes in b plus tree?', 'start': 66.804, 'duration': 2.701}, {'end': 70.366, 'text': 'only the pointer.', 'start': 69.505, 'duration': 0.861}, {'end': 76.404, 'text': 'so you can see the indexes Find indexes to the data which is stored in the leaf node.', 'start': 70.366, 'duration': 6.038}, {'end': 79.205, 'text': 'Those indexes are stored in internal nodes.', 'start': 76.864, 'duration': 2.341}, {'end': 83.367, 'text': 'And second important point is the data which is present in leaf node.', 'start': 80.065, 'duration': 3.302}, {'end': 89.449, 'text': 'Those data is present in a formal link list, right? All the leaves are connected with a link with each other.', 'start': 83.727, 'duration': 5.722}, {'end': 93.21, 'text': "I'll show you how when we are creating a B plus tree with this example.", 'start': 89.869, 'duration': 3.341}, {'end': 96.513, 'text': 'right. so these are the two main differences.', 'start': 93.71, 'duration': 2.803}], 'summary': 'B+ tree properties: max children=4, min children=2, max keys=3, min keys=1; data stored only in leaf nodes; indexes stored in internal nodes; leaf nodes connected in a linked list.', 'duration': 96.384, 'max_score': 0.129, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/DqcZLulVJ0M/pics/DqcZLulVJ0M129.jpg'}, {'end': 227.293, 'src': 'embed', 'start': 198.145, 'weight': 5, 'content': [{'end': 200.145, 'text': 'because it is overflow condition.', 'start': 198.145, 'duration': 2}, {'end': 204.707, 'text': 'maximum keys in a node can be only 3 here.', 'start': 200.145, 'duration': 4.562}, {'end': 206.008, 'text': 'fine in this case.', 'start': 204.707, 'duration': 1.301}, {'end': 207.449, 'text': 'so now what should be done now?', 'start': 206.008, 'duration': 1.441}, {'end': 209.57, 'text': 'this node should be splitted now.', 'start': 207.449, 'duration': 2.121}, {'end': 219.374, 'text': 'btree and b plus tree also always grow towards root upward direction, not to the towards leaf direction right.', 'start': 209.57, 'duration': 9.804}, {'end': 224.411, 'text': 'so we are going to find how how this node is to be splitted now.', 'start': 219.374, 'duration': 5.037}, {'end': 227.293, 'text': 'find out the middle element now.', 'start': 224.411, 'duration': 2.882}], 'summary': 'Overflow condition, splitting node with maximum 3 keys. btree grows upward towards root.', 'duration': 29.148, 'max_score': 198.145, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/DqcZLulVJ0M/pics/DqcZLulVJ0M198145.jpg'}, {'end': 296.805, 'src': 'embed', 'start': 274.771, 'weight': 6, 'content': [{'end': 283.239, 'text': 'and if you consider 7 as a middle element and you split from this node, then the tree would be right biased.', 'start': 274.771, 'duration': 8.468}, {'end': 283.86, 'text': "so it's up to you.", 'start': 283.239, 'duration': 0.621}, {'end': 285.82, 'text': 'you can take 4 also.', 'start': 284.96, 'duration': 0.86}, {'end': 287.481, 'text': 'you can take 7 also.', 'start': 285.82, 'duration': 1.661}, {'end': 294.764, 'text': 'but in starting, if you, if you construct the left biased tree, then during the completion of the complete tree you are supposed to follow that rule,', 'start': 287.481, 'duration': 7.283}, {'end': 296.805, 'text': 'also the left biased tree.', 'start': 294.764, 'duration': 2.041}], 'summary': 'Construct a left-biased tree at the start to follow the rule during completion.', 'duration': 22.034, 'max_score': 274.771, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/DqcZLulVJ0M/pics/DqcZLulVJ0M274771.jpg'}], 'start': 0.129, 'title': 'B+ tree properties & differences and b tree splitting', 'summary': 'Explains the properties of a b+ tree, including the maximum and minimum children and keys based on the tree order, unique data storage in leaf nodes, and the use of formal linked lists for leaf node data. it also mentions the differences between b+ tree and b tree. additionally, it explains the process of b tree splitting with an order of four, demonstrating the insertion of keys 1, 4, 7, and 10, and the subsequent node splitting when encountering overflow conditions.', 'chapters': [{'end': 116.431, 'start': 0.129, 'title': 'B+ tree properties & differences', 'summary': 'Explains the properties of a b+ tree, including the maximum and minimum children and keys based on the tree order, the unique data storage in leaf nodes, and the use of formal linked lists for leaf node data. additionally, it mentions the differences between b+ tree and b tree.', 'duration': 116.302, 'highlights': ['B+ tree properties include maximum children as the order given, maximum keys as order minus 1, and unique data storage in leaf nodes.', 'The minimum children in a B+ tree are half the order (ceil), and the minimum keys are half the order (ceil) minus 1, except for the root node.', 'Data in B+ tree is stored only in leaf nodes, while internal nodes store indexes to the leaf node data and pointers.', 'Leaf nodes in a B+ tree are connected in a formal linked list structure.', 'A B+ tree differs from a B tree as it stores data only in leaf nodes and uses formal linked lists for leaf node data.']}, {'end': 317.039, 'start': 117.423, 'title': 'B tree splitting', 'summary': 'Explains the process of b tree splitting with an order of four, demonstrating the insertion of keys 1, 4, 7, and 10, and the subsequent node splitting when encountering overflow conditions.', 'duration': 199.616, 'highlights': ['The maximum number of keys a node can have is three, and the maximum number of children can be four, leading to the need for node splitting when the overflow condition occurs.', 'When encountering an overflow condition, the node needs to be split, and the decision of whether to construct a left-biased or right-biased tree is dependent on the selection of the middle element.', 'The splitting process in B tree and B plus tree always results in the tree growing in an upward direction towards the root, not towards the leaf direction.']}], 'duration': 316.91, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/DqcZLulVJ0M/pics/DqcZLulVJ0M129.jpg', 'highlights': ['B+ tree properties: max children = order, max keys = order - 1', 'Minimum children in B+ tree: half order (ceil)', 'Data in B+ tree stored only in leaf nodes, internal nodes store indexes', 'Leaf nodes in B+ tree connected in formal linked list structure', 'B+ tree differs from B tree by storing data only in leaf nodes', 'Node splitting needed in B+ tree when overflow occurs', 'Decision of left-biased or right-biased tree depends on middle element', 'Splitting in B tree and B+ tree results in upward growth towards root']}, {'end': 527.383, 'segs': [{'end': 393.005, 'src': 'embed', 'start': 317.039, 'weight': 1, 'content': [{'end': 319.899, 'text': 'so now seven, suppose seven, is middle element.', 'start': 317.039, 'duration': 2.86}, {'end': 321.78, 'text': 'so i am going to split from this data.', 'start': 319.899, 'duration': 1.881}, {'end': 323.14, 'text': 'now how splitting would be done?', 'start': 321.78, 'duration': 1.36}, {'end': 328.281, 'text': "seven would go one level up, or you can say to its parent now here we don't have any parent.", 'start': 323.14, 'duration': 5.141}, {'end': 331.782, 'text': 'so seven would go up and that seven would become parent.', 'start': 328.281, 'duration': 3.501}, {'end': 336.663, 'text': 'now the tree would be something like this see, seven would go up.', 'start': 331.782, 'duration': 4.881}, {'end': 340.38, 'text': 'so create another node.', 'start': 338.7, 'duration': 1.68}, {'end': 342.001, 'text': 'the maximum capacity is 3 keys.', 'start': 340.38, 'duration': 1.621}, {'end': 343.141, 'text': 'to the left of 7.', 'start': 342.001, 'duration': 1.14}, {'end': 350.783, 'text': 'to the left of 7 we have 1 and 4, 1 and 4 right.', 'start': 343.141, 'duration': 7.642}, {'end': 359.486, 'text': 'here also we can insert for more data and to the right of 7, to the right of 7, what we can insert maximum capacity is 3.', 'start': 350.783, 'duration': 8.703}, {'end': 363.227, 'text': 'to the right of 7 we have 10 right plus.', 'start': 359.486, 'duration': 3.741}, {'end': 366.327, 'text': 'in B plus tree, what you will insert.', 'start': 364.426, 'duration': 1.901}, {'end': 370.41, 'text': 'you will insert this 7 also in this node, 7 and 10.', 'start': 366.327, 'duration': 4.083}, {'end': 371.351, 'text': 'why so?', 'start': 370.41, 'duration': 0.941}, {'end': 375.374, 'text': 'because, see, I have told you in B plus tree the data, all the data.', 'start': 371.351, 'duration': 4.023}, {'end': 379.236, 'text': 'this data should be present in leaf node right.', 'start': 375.374, 'duration': 3.862}, {'end': 385.54, 'text': 'so if you do not insert 7 here, so this is the leaf node and 7 is not present in the leaf node.', 'start': 379.236, 'duration': 6.304}, {'end': 387.902, 'text': 'so data should be present in leaf node.', 'start': 385.54, 'duration': 2.362}, {'end': 391.765, 'text': 'now, why you are inserting 7 to the right of this this 7.', 'start': 387.902, 'duration': 3.863}, {'end': 393.005, 'text': "why can't you insert 7 here?", 'start': 391.765, 'duration': 1.24}], 'summary': 'Explaining the process of splitting and inserting data in a b plus tree.', 'duration': 75.966, 'max_score': 317.039, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/DqcZLulVJ0M/pics/DqcZLulVJ0M317039.jpg'}, {'end': 501.794, 'src': 'embed', 'start': 469.032, 'weight': 0, 'content': [{'end': 470.333, 'text': 'next is 21, where 21 can insert.', 'start': 469.032, 'duration': 1.301}, {'end': 473.055, 'text': '21 is greater than 7, greater than 7, 10 and 21.', 'start': 470.333, 'duration': 2.722}, {'end': 479.997, 'text': 'so here you can insert 21..', 'start': 473.055, 'duration': 6.942}, {'end': 482.239, 'text': 'but actually we cannot insert overflow.', 'start': 479.997, 'duration': 2.242}, {'end': 482.879, 'text': 'condition is there.', 'start': 482.239, 'duration': 0.64}, {'end': 483.98, 'text': 'now we have to split this node.', 'start': 482.879, 'duration': 1.101}, {'end': 486.582, 'text': 'now how splitting is to be done?', 'start': 483.98, 'duration': 2.602}, {'end': 487.143, 'text': 'the middle element.', 'start': 486.582, 'duration': 0.561}, {'end': 492.627, 'text': 'take the middle element and that middle element would go one level up right.', 'start': 487.143, 'duration': 5.484}, {'end': 494.808, 'text': 'so now i am constructing the right bias tree.', 'start': 492.627, 'duration': 2.181}, {'end': 497.731, 'text': 'so here i am going to take 17 as middle element.', 'start': 494.808, 'duration': 2.923}, {'end': 501.794, 'text': 'so 17 would go to its parent node or you can say one level up.', 'start': 497.731, 'duration': 4.063}], 'summary': 'Splitting process, inserting 21, considering 17 as the middle element.', 'duration': 32.762, 'max_score': 469.032, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/DqcZLulVJ0M/pics/DqcZLulVJ0M469032.jpg'}], 'start': 317.039, 'title': 'Tree insertion and splitting', 'summary': 'Covers the insertion process into b plus and binary trees, including node splitting, maximum capacity, and data presence in leaf nodes. it also explains binary tree insertion, node splitting, and provides examples of inserting specific values such as 7, 17, and 21 into a binary tree.', 'chapters': [{'end': 393.005, 'start': 317.039, 'title': 'B plus tree insertion', 'summary': 'Explains the process of inserting elements into a b plus tree, highlighting the splitting of nodes, maximum capacity, and the necessity of data presence in leaf nodes.', 'duration': 75.966, 'highlights': ['The data in a B plus tree should be present in leaf nodes, necessitating the insertion of elements like 7 and 10 to ensure data presence at the leaf node level.', 'The process of inserting elements into a B plus tree involves splitting nodes, with a maximum capacity of 3 keys for each node, as demonstrated by the insertion of elements like 1, 4, and 10 around the middle element 7.']}, {'end': 527.383, 'start': 394.676, 'title': 'Binary tree insertion and splitting', 'summary': 'Explains binary tree insertion and splitting, inserting nodes based on their values, and the process of splitting nodes when facing overflow, using examples of inserting 7, 17, and 21 into a binary tree.', 'duration': 132.707, 'highlights': ['The rule for inserting data into a binary tree involves placing data less than the node to its left and data greater than or equal to the node to its right.', 'The process of inserting 7, 17, and 21 into the binary tree is explained, with 17 leading to the splitting of a node due to overflow.', 'The method of splitting a node in a binary tree is detailed, involving moving the middle element up one level and rearranging the tree accordingly.']}], 'duration': 210.344, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/DqcZLulVJ0M/pics/DqcZLulVJ0M317039.jpg', 'highlights': ['The process of inserting 7, 17, and 21 into the binary tree is explained, with 17 leading to the splitting of a node due to overflow.', 'The method of splitting a node in a binary tree is detailed, involving moving the middle element up one level and rearranging the tree accordingly.', 'The data in a B plus tree should be present in leaf nodes, necessitating the insertion of elements like 7 and 10 to ensure data presence at the leaf node level.', 'The process of inserting elements into a B plus tree involves splitting nodes, with a maximum capacity of 3 keys for each node, as demonstrated by the insertion of elements like 1, 4, and 10 around the middle element 7.']}, {'end': 1116.114, 'segs': [{'end': 860.16, 'src': 'heatmap', 'start': 812.468, 'weight': 0.824, 'content': [{'end': 817.291, 'text': 'to the right of this we have 7 and 10.', 'start': 812.468, 'duration': 4.823}, {'end': 825.896, 'text': 'to the right of 17 we have 17, 19.', 'start': 817.291, 'duration': 8.605}, {'end': 833.521, 'text': 'right now these are leaf nodes right and this is internal node and this is also internal node.', 'start': 825.896, 'duration': 7.625}, {'end': 837.348, 'text': 'so now the rule is These keys.', 'start': 833.521, 'duration': 3.827}, {'end': 840.213, 'text': 'this cannot be repeated in internal nodes.', 'start': 837.348, 'duration': 2.865}, {'end': 843.325, 'text': 'so here you have written just 20.', 'start': 841.283, 'duration': 2.042}, {'end': 845.767, 'text': 'so here you cannot write this 20.', 'start': 843.325, 'duration': 2.442}, {'end': 850.071, 'text': 'you are going to cross 20 from here, because what actual data is?', 'start': 845.767, 'duration': 4.304}, {'end': 855.956, 'text': 'in leaf node and in internal nodes we just have indexes.', 'start': 850.071, 'duration': 5.885}, {'end': 860.16, 'text': 'so what is the point to repeat the same index again and again?', 'start': 855.956, 'duration': 4.204}], 'summary': 'Discussing indexing rules in a tree structure with examples.', 'duration': 47.692, 'max_score': 812.468, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/DqcZLulVJ0M/pics/DqcZLulVJ0M812468.jpg'}, {'end': 1073.758, 'src': 'embed', 'start': 1045.117, 'weight': 1, 'content': [{'end': 1047.339, 'text': 'the node is having space of three keys.', 'start': 1045.117, 'duration': 2.222}, {'end': 1048.999, 'text': 'so here i have shortage of space.', 'start': 1047.339, 'duration': 1.66}, {'end': 1052.5, 'text': 'that is why i have just made a little bit mashed up.', 'start': 1048.999, 'duration': 3.501}, {'end': 1053.941, 'text': 'fine. so i hope you are getting.', 'start': 1052.5, 'duration': 1.441}, {'end': 1055.001, 'text': 'this is the tree.', 'start': 1053.941, 'duration': 1.06}, {'end': 1058.542, 'text': 'fine, these nodes are having space of three keys, right maximum.', 'start': 1055.001, 'duration': 3.541}, {'end': 1059.803, 'text': 'you can insert three keys.', 'start': 1058.542, 'duration': 1.261}, {'end': 1064.424, 'text': 'now see, as you can see this, this data, this data is present in the leaf node.', 'start': 1059.803, 'duration': 4.621}, {'end': 1066.485, 'text': 'all the data you can check.', 'start': 1064.424, 'duration': 2.061}, {'end': 1073.758, 'text': 'fine, and in this, internal loads, we are having just the indexes, fine, or you can say pointers.', 'start': 1066.485, 'duration': 7.273}], 'summary': 'The node has space for three keys, allowing insertion of three keys, with data stored in leaf nodes and indexes in internal nodes.', 'duration': 28.641, 'max_score': 1045.117, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/DqcZLulVJ0M/pics/DqcZLulVJ0M1045117.jpg'}, {'end': 1114.413, 'src': 'embed', 'start': 1085.707, 'weight': 0, 'content': [{'end': 1093.754, 'text': 'because the data is present in the leaf node, you have to just fetch the root block, this block, and only one leaf, one leaf node, because one, this,', 'start': 1085.707, 'duration': 8.047}, {'end': 1098.598, 'text': 'this leaf node is having the pointer to this leaf node, then this, then this, then this and something like this.', 'start': 1093.754, 'duration': 4.844}, {'end': 1104.709, 'text': 'fine. so searching is very easy when data is stored in the form of b plus tree.', 'start': 1099.346, 'duration': 5.363}, {'end': 1114.413, 'text': 'i am going to discuss with you all the properties of b plus tree in next video and in next video we are also going to discuss how to delete data from b plus tree.', 'start': 1104.709, 'duration': 9.704}], 'summary': 'Data in b+ tree allows easy searching and efficient storage.', 'duration': 28.706, 'max_score': 1085.707, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/DqcZLulVJ0M/pics/DqcZLulVJ0M1085707.jpg'}], 'start': 527.383, 'title': 'B+ tree insertion process', 'summary': "Explains the process of inserting data into a b+ tree, involving splitting nodes and maintaining the tree's structure for efficient data retrieval, with a maximum node capacity of three keys.", 'chapters': [{'end': 1116.114, 'start': 527.383, 'title': 'B+ tree insertion process', 'summary': "Explains the process of inserting data into a b+ tree, which involves splitting nodes and maintaining the tree's structure to ensure efficient data retrieval, with a maximum node capacity of three keys.", 'duration': 588.731, 'highlights': ["The process of inserting data into a B+ tree involves splitting nodes to maintain the tree's structure and ensure efficient data retrieval.", 'The maximum capacity of a node in the B+ tree is three keys, and the splitting process is carried out when a node overflows.', "The B+ tree's structure follows the Binary Search Tree (BST) properties, ensuring that the data is correctly placed within the tree."]}], 'duration': 588.731, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/DqcZLulVJ0M/pics/DqcZLulVJ0M527383.jpg', 'highlights': ["The process of inserting data into a B+ tree involves splitting nodes to maintain the tree's structure and ensure efficient data retrieval.", 'The maximum capacity of a node in the B+ tree is three keys, and the splitting process is carried out when a node overflows.', "The B+ tree's structure follows the Binary Search Tree (BST) properties, ensuring that the data is correctly placed within the tree."]}], 'highlights': ['B+ tree properties: max children = order, max keys = order - 1', 'Data in B+ tree stored only in leaf nodes, internal nodes store indexes', 'Node splitting needed in B+ tree when overflow occurs', "The process of inserting data into a B+ tree involves splitting nodes to maintain the tree's structure and ensure efficient data retrieval", 'The process of inserting 7, 17, and 21 into the binary tree is explained, with 17 leading to the splitting of a node due to overflow', 'The maximum capacity of a node in the B+ tree is three keys, and the splitting process is carried out when a node overflows', 'The method of splitting a node in a binary tree is detailed, involving moving the middle element up one level and rearranging the tree accordingly', "The B+ tree's structure follows the Binary Search Tree (BST) properties, ensuring that the data is correctly placed within the tree", 'Minimum children in B+ tree: half order (ceil)', 'Leaf nodes in B+ tree connected in formal linked list structure', 'B+ tree differs from B tree by storing data only in leaf nodes', 'Decision of left-biased or right-biased tree depends on middle element', 'Splitting in B tree and B+ tree results in upward growth towards root', 'The data in a B plus tree should be present in leaf nodes, necessitating the insertion of elements like 7 and 10 to ensure data presence at the leaf node level', 'The process of inserting elements into a B plus tree involves splitting nodes, with a maximum capacity of 3 keys for each node, as demonstrated by the insertion of elements like 1, 4, and 10 around the middle element 7']}