When node are inserted in a BST in a shorted order, tree becomes skew in nature and known as skewed tree. There are two types of skewed trees i.e. left skewed and right skewed. The purpose of making BST is to reduce the element search time but in case of skewed trees, it becomes linear search and time complexity for skewed tree becomes O(n). I don't see any different between skewed tree and linked list in the context of element search but tree nodes will be having two pointer (left and right) while for linked list implementation only single pointer reference is sufficient to refer the next node.
