Question

what is the common between binary search tree and B tree? Can all the binary search tree be considered a special case of some vaild B tree why or why not?

Answer 1

The common difference between binary search tree and B tree is that, in binary tree there is no ordering of the nodes whereas in binary search tree the nodes are ordered in a way such that the left subtree is lesser than the parent nodes and the parent nodes are less than the right sub tree.

Yes, all binary search tree can be considered a special case of same valid B tree because of the following reasons:

1) Every nodes in the tree has a key value which is different from all the values present in tree

2) Left sub trees are smaller than nodes which infact smaller than the right sub tree.

3) In order to allow more than two child nodes the B tree generalises the Binary search tree

If you liked the solution then give a thumbs up ? it will be really appreciated ?