Discussion Board

Data Structure - Binary Tree and B-Tree The above statement is wrong. B-tree is not an acronym for Binary tree, both are different. A binary tree is a tree in which each node has at most two children. Each child is referred to as either left child or right child. In a binary tree, each node can have at most two children, but in a B-tree a node may have more than two children. In a B-tree, all leaf nodes should be at the same level and every node, except for the root and the leaves, has at least m/2 children. Prajakta Pandit 02-1-2017 12:52 AM

Write your comments

*

* Email must be in the form someone@domain.com

*

*