Skewed Binary Tree: Definition, Types, and Characteristics

Rumman Ansari   Software Engineer   2024-07-05 05:59:09   9378  Share
Subject Syllabus DetailsSubject Details
☰ TContent
☰Fullscreen

Table of Content:

  • 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.


    • skewed binary tree

  • 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.