# B Tree is an acronym for Binary Tree. - Data Structure

Q.  B Tree is an acronym for Binary Tree.
- Published on 26 Aug 15

a. True
b. False

#### Discussion

• Nirja Shah   -Posted on 21 Nov 15
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.
Some properties of binary tree are as follows.
- The maximum number of nodes on any level i is 2 i . An example of the maximum number of nodes at level 3 will be 23=8.
- The maximum number of nodes in a binary tree of height h is 2h – 1.
There are different types of binary tree.
- Strictly binary tree
- Extended binary tree
- Full binary tree
- Complete binary tree
- Binary search tree
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.
B-tree must satisfy the following properties. Consider B-tree of order m.
- All leaf nodes should be at the same level.
- Every node, except for the root and the leaves, has at least m/2 children. If m=5 then m/2=5/2=2.5, then the minimum number of children is 3. Choose the smallest integer which is greater than m/2.
- Every node has a maximum of m children.
- The root has at least two children (unless it is a leaf).

## ➨ Post your comment / Share knowledge

Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)