Table of Contents
Skewed Binary Tree: Definition, Types, and Characteristics
- If a tree which is dominated by left child node or right child node, is said to be a Skewed Binary Tree.
- In a skewed binary tree, all nodes except one have only one child node. The remaining node has no child.
- In a left skewed tree, most of the nodes have the left child without corresponding right child.
- In a right skewed tree, most of the nodes have the right child without corresponding left child.