What is the time complexity for finding an element in a binary search tree?

The time complexity for finding an element in a binary search tree is O(log n), where n is the number of nodes in the tree.