@skp
To insert an element, we need to search for its place first.
The search operation may take O(n) for a skewed tree like following.
To insert 60, we will have to traverse all nodes.
20
\
30
\
40
\
50
after finding 50 from top to bottom we can insert 60 only in this tree .. so worst case time it takes O(n)