Queues Q.120

0. The smallest number of key that will force a B-tree of order 3 to have a height 3 is

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *