What is the worst-case time complexity of searching an element in a Binary Search Tree?

The worst-case time complexity of searching an element in a Binary Search Tree (BST) is O(n).

Here's why:

1. A Binary Search Tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child.

2. For a search operation, we start from the root node and compare the value we are searching with the value of the node.

3. If the value is equal to the node, then we have found the element.

4. If the value is less than the node, then the search continues on the left subtree. Conversely, if the value is greater than the node, then the search continues on the right subtree.

5. This process continues until we either find the element or reach a null (empty) node.

6. In the worst-case scenario, the BST can be skewed, meaning all the nodes are on one side of the root, making it look like a linked list. In this case, we would have to traverse through all the nodes.

7. Therefore, the worst-case time complexity of searching an element in a BST is O(n), where n is the number of nodes in the tree.