Questions about time complexity for the Get Method in BinarySearch Tree:

1. What is the Big-O notation of the get method if items inthe Binary Search Tree are inserted in order? If the items areinserted in an order where the tree is balanced? (n is the numberof elements in the Binary Search Tree) Please explainwhy.

I'm having trouble with figuring this one out. I know that thePut Method has time complexity O(n) when constructing asearch tree that has height n by inserting the keys in sortedorder. And in a balanced binary tree, the worst-caseperformance of the Put Method is O(log 2 n),where n is the number of nodes in the tree... However, Iam unsure about the Big-O notation for the Get Method... pleasehelp!