Wed 6 Nov, 2013 01:55 pm
In data structure there are two types of tree B tree and B+ tree but what is the actual difference between them please illustrate.
@Kathleenortan,
A B+ tree can be viewed as a B-tree in which each node contains only keys (not key-value pairs), and to which an additional level is added at the bottom with linked leaves
http://en.wikipedia.org/wiki/B%2B_tree
Kathy I'm wondering if somehow you don't have access to Google
Stumble It!
Tweet This
Bookmark on Delicious
Share on Facebook
Share on MySpace