A strictly binary tree of depth ’d’ in which all the leaves are at level ’d’ i.e. there is non empty left or right subtrees and leaves are populated at the same level.
In a complete binary tree all the internal nodes have equal degree, which means that one node at the root level, two nodes at level 2, four nodes at level 3, eight nodes at level 4, etc, which the below figure represents:
See also
- Given a BST with 2 nodes swapped, fix it
- Given a binary search tree with 2 nodes swapped find number of pairs not following BST properties
- For a Given node of a binary tree, print the K distance nodes.
- Print all nodes that are at distance k from a leaf node
- Find the distance between 2 nodes in Binary Tree