18 votes 18 votes Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table? B+ Tree is a height-balanced tree Non-leaf nodes have pointers to data records Key values in each node are kept in sorted order Each leaf node has a pointer to the next leaf node Databases gatecse-2019 databases b-tree 1-mark + – Arjun asked Feb 7, 2019 retagged Nov 30, 2022 by Lakshman Bhaiya Arjun 10.4k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Shubhanshu commented Feb 7, 2019 reply Follow Share B is the correct answer. 3 votes 3 votes `JEET commented Dec 13, 2019 reply Follow Share No $\mathbf{B}$ is the wrong answer which is correct. :) 5 votes 5 votes npx commented Jul 7, 2021 reply Follow Share B statement is wrong because it has written non-leaf nodes, if we make it leaf nodes then B is correct. (only talking about the theory not the answer) 1 votes 1 votes Please log in or register to add a comment.
Best answer 34 votes 34 votes Properties of B+ trees: 1. B+ tree is height balance tree. 2. Key value is in sorted order. 3. Leaf node has pointer to next leaf node. 4. Non leaf node has pointer to a node (leaf or non leaf) and not pointer to data record. Option B is not correct. Digvijay Pandey answered Feb 7, 2019 edited May 13, 2019 by Krithiga2101 Digvijay Pandey comment Share Follow See all 2 Comments See all 2 2 Comments reply jlimbasiya commented Nov 7, 2019 reply Follow Share @Digvijay Pandey is B tree also height balance tree?? as like B+ tree in B also all leaf are same node so B is also height balanced tree am I correct? 0 votes 0 votes Raju Kalagoni commented Nov 20, 2019 reply Follow Share @jlimbasiya, yes! you are correct, B-tree is also height balanced tree:) 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Only leaf nodes have pointer for the data records, hence option B is not a property of a B+ tree. Therefore, option B is correct answer. Pat_007 answered Aug 25, 2020 Pat_007 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Option B is correct root node and internal node of B + tree does not contain Data pointer/record pointer only leaf node will contain . and in B tree root node , internal node as well as Leaf node will also contain Data Pointer . Himanshu Kumar Gupta answered Sep 13, 2020 Himanshu Kumar Gupta comment Share Follow See all 0 reply Please log in or register to add a comment.