2 votes 2 votes 2018 asked Jan 16, 2017 2018 429 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Rahul Jain25 commented Jan 16, 2017 reply Follow Share Option a) is definately right, no doubt about that. Bcoz B+tree also stores duplicate keys i.e. all record pointers are at leaf level still keys are stored in upper levels , and in B tree record pointers are in upper levels along with leafs. So B+ tree will have at least as many nodes as B tree. But I dont know what do "IO cost" mean here. Maybe they mean no. Of blocks required. If no of blocks they are talking about then yes since B+ tree is storing keys multiple times more data block may be require. Please correct me if I am wrong bcoz I am not sure about IO cost here. 0 votes 0 votes Smriti012 commented Feb 7, 2017 reply Follow Share @Rahul Jain25 i/o cost of b/b+ tree is #levels +1. 0 votes 0 votes Please log in or register to add a comment.
