0
no they are not same
The complexity of binary search tree :
Search , Insertion and Deletion is O(h) . and the Height can be of O(n) ( if the tree is a skew tree).
For Balanced Binary Trees , the Order is O(log n).
By using Depth First Search or Breadth First search Tree traversal algorithm we can print data in Binary search tree.
self depend friend"s............
A binary search tree is already ordered. An in order traversal will give you a sorted list of nodes.