doubt

Question

Why B-tree & B+ tree is used in database indexing instead of other tree like BST, Binary tree etc??

Comments

height of B and B+ tress are very less than that of BST ..and complexity in tress directly depends on height .so we go for B and B+ trees

Answer 1

In Computer Science we generally talk about Space complexity and Time complexity, we always want to decrease the searching cost, i/o cost of accessing the file, so that if we use the binary tree at max we can have 2 nodes for each node but in B and B+ tree we have order of node we max no. of order B and B+ tree .and minimum level of B and B+ tree we have many no. key and in Binary Tree this is not possible so that, searching level get decrease in the B and B+ tree ......and we  search randomly and sequence manner   in  B and B+ tree  

Answer 2

B and B+ trees are balanced. The distance from root to all leaves are equal. Searching is efficient. Memory transfers are also less.So they are prefered over BST and Binary trees.