## Discussion Forum

Que. | The order of an internal node in a B+ tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node? |

a. | 24 |

b. | 25 |

c. | 26 |

d. | 27 |

Answer:26 |