While creating binary search tree if elements are entered into shorted order (ascending/descending) then BST would be right-skewed/left-skewed BST. In these scenario, binary tree would be solely dominated by either left child or right child nodes.
In this case if you want to search an element then it will take O(n) time-complexity. While it is O(log n) when nodes in BST are balanced.
