Only leaf nodes contain data pointers along with keys, internal nodes contain keys only. Duplicate keys are present in this, all internal nodes are also present at leaves. Leaf nodes are linked to each other. All nodes are present at leaves, so sequential access is possible just like a linked list. Searching is faster. The height of the B+ tree is lesser than B tree for the same number of entries.