Binary tree and its properties
Properties of binary tree
- A binary tree can be either empty (without any nodes), or consists of only one node (root node), or consists of a root node with two binary sub-trees called left sub-tree and right sub-tree.
- A binary tree with no nodes is called NULL tree.
- If h is the height of a binary tree,
- The tree can have maximum of 2h leaf nodes (leaves).
- The tree can have maximum of 2h+1-1 nodes (internal+external nodes)
- The minimum number of nodes is h+1.
- Minimum number of levels of a binary tree with N nodes is ⌊log2N⌋+1 (flooring of log2N+1)
- A binary tree with L leaves have at least ⌊log2L⌋+1 levels
All trees given in the following picture are binary trees;
Go to Types of Binary Tree page
binary tree and its properties
height of a binary tree
minimum levels in a binary tree
minimum number of nodes in a binary tree
maximum number of nodes in a binary tree
binary tree examples