Skewed Binary Tree
In this lesson, we will discuss another type of Binary Tree called a Skewed Binary Tree. We will look at some of its properties and types.
We'll cover the following
Introduction #
Skewed Binary Trees are Binary trees where all the nodes except one have one and only one child. All of the children nodes are either left or right child nodes, so the entire tree is positioned to the left or the right side. This type of Binary Tree structure should be avoided at all costs because the time complexity of most operations will be high.
Left-Skewed Binary Trees #
The two types of Skewed Binary Trees are based on which side the tree leans. The left-skewed binary tree has all left child nodes.
Right-Skewed Binary Trees #
Right skewed binary trees have all right nodes.
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.