Discuss the difference between the way that B-trees and binary search trees are implemented. Be sure to include efficiency in your discussion Solution B-tree Binary Search Tree 1.B-tree is self balancing tree data structure 1.Sometimes these are called ordered or sorted binary trees 2.Each internal node of a B-tree will contain a number of keys,these keys are act as separation values which divides its subtrees. 2.In this finding an item by its key. 3.these are uses to speed up insertions and deletions. 3.These are design to improve the efficiency of searching through the contents of a binary tree. 4.Using B-trees may waste some space,it need only one pointer and no need to be full. 4.In implementing for every node n,every descendent nodes value in the left subtree of n is less than the value of n,and the every descendant node\'s value in the right subtree is greater than than the value of n. 5.Every path from the root to a leaf has the same length and the root has atleast two children. 5.Here also we can calculate the length of the tree but here we no need to maintain same length from root to leaf. .

1. Discuss the difference between the way that B-trees and binary search trees are implemented. Be
sure to include efficiency in your discussion
Solution
B-tree Binary Search Tree 1.B-tree is self balancing tree data structure 1.Sometimes these are
called ordered or sorted binary trees 2.Each internal node of a B-tree will contain a number of
keys,these keys are act as separation values which divides its subtrees. 2.In this finding an item
by its key. 3.these are uses to speed up insertions and deletions. 3.These are design to improve
the efficiency of searching through the contents of a binary tree. 4.Using B-trees may waste
some space,it need only one pointer and no need to be full. 4.In implementing for every node
n,every descendent nodes value in the left subtree of n is less than the value of n,and the every
descendant node's value in the right subtree is greater than than the value of n. 5.Every path
from the root to a leaf has the same length and the root has atleast two children. 5.Here also we
can calculate the length of the tree but here we no need to maintain same length from root to leaf.