Editor">
Editor Staff asked 5 months ago
Editor Staff asked 5 months ago
Compression techniques can be used on the keys to reduce both space and time requirements in a B-tree.
(a) True
(b) False
My query is from B-Trees topic in portion B-Trees of Data Structures & Algorithms I
I have been asked this question in an interview.
1 Answers
Editor">Editor Staff answered 5 months ago
Editor Staff answered 5 months ago
Correct answer is (a) True
Easiest explanation – The front compression and the rear compression are techniques used to reduce space and time requirements in B-tree. The compression enables to retain more keys in a node so that the number of nodes needed can be reduced.
