in BST,we visit each node exactly 3 times with constant amount of time..therefore for inorder traversal.we visit
n*3*c=O(n).time complexity.
where n=no of nodes,c=constant amount of time spend on each node.
even,this complexity is applicable for postorder and preorder too.