0 votes 0 votes Which one is NOT True among these statements: In B+-tree, data pointers are stored only at the leaf nodes of the tree Any B-tree is a search tree may not be always balanced In a B-tree, every value of the search field appears once at some level in the tree The leaf nodes of the B+-tree are linked together to provide ordered access on the search field to the records Databases tbb-dbms-1 + – Bikram asked Nov 26, 2016 edited Aug 22, 2019 by go_editor Bikram 240 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 0 votes 0 votes Any B-tree is a search tree may not be always balanced --- is FALSE. B-tree is a search tree which is always balanced Bikram answered Nov 26, 2016 selected Aug 22, 2019 by Bikram Bikram comment Share Follow See all 0 reply Please log in or register to add a comment.