What are the differences between B trees and B+ trees?

Question

In a b-tree you can store both keys and data in the internal and leaf nodes, but in a b+ tree you have to store the data in the

Answer 1

A B+tree is a balanced tree in which every path from the root of the tree to a leaf is of the same length, and each nonleaf node of the tree has between [n/2] and [n] children, where n is fixed for a particular tree. It contains index pages and data pages. Binary trees only have two children per parent node, B+ trees can have a variable number of children for each parent node