0 0 votes " B+ tree index has more levels than B tree index for large number of keys. " How the above statement is true ?? Databases made-easy-test-series databases b-tree + – ashish pal 919 views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply Ashwin Kulkarni commented Dec 26, 2017 reply Follow flag Because when keys are large duplicates also grows drastically in B+ trees hence levels increses 0 0 replyShare Amal commented Jan 20, 2019 reply Follow flag but having record pointer in every level will increase the height of the B tree ?(less key in a level, which cause height increase, isn't ?) no of children in a B+ tree is more than B tree. so i don't think redundant data will increase the height. 0 0 replyShare Please log in or register to add a comment.
1 1 vote TRUE B+ tree contain redundant key . so it contain more level. abhishekmehta4u answered Mar 28, 2018 abhishekmehta4u comment Share Follow 0 reply Please log in or register to add a comment.
