Question: what is the difference between b tree and m way tree?
Answer: A binary search tree has only two fixed branches and is therefore a lot easier to implement. m-way trees such as B-trees are generally used when the tree has to be stored on disk rather than in memory. ... The root has at least two subtrees unless it is the only node in the tree.