title: Skewed Trees relation to Binary Search Tree
body: <p>I know what Binary search tree is and I know how they work. But what does it take for it to become a skewed tree? What I mean is, do all nodes have to go on one side? or is there any other combination?</p>
  
  <p>Having a tree in this shape (see below) is the only way to make it a skewed tree? If not, what are other possible skewed trees?</p>
  
  <p>Skewed tree example:
  <img src="https://i.stack.imgur.com/Zhb5e.png" alt="Example"></p>
  
  <p>Also, I searched but couldn't find a good solid definition of a skewed tree. Does anyone have a good definition?</p>