# Searching in a BST

### Procedure :

* Start from the root node.
* Compare the data in each node with the key. If it matches, return pointer to that node.
* If the key is lesser than the data in the node, move pointer to the left child.
* If the key is greater than the data in the node,  move pointer to the right child.
* If pointer becomes null, it means the we have reached the end of the tree and the element was not found. Therefore, return NULL.

### Iterative Function :

```c
struct Node *BSTsearch(struct Node *ptr, int key) {

    while (ptr != NULL) {
        if (key == ptr -> data) {
            return ptr;
        } else if (key < ptr -> data) {
            ptr = ptr -> left;
        } else {
            ptr = ptr -> right;
        }
    }
    return NULL;
    
}
```

### Recursive Function :

```c
struct Node *BSTsearch(struct Node *ptr, int key) {

    if (ptr == NULL) {
        return NULL;
    }
    
    if (key == ptr -> data) {
        return ptr;
    } else if (key < ptr -> data) {
        return BSTsearch(ptr -> left, key);
    } else {
        return BSTsearch(ptr -> right, key);
    }

}
```

**Time Complexity : O(log n)**

Contributed by Nitin Ranganath


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://nitinranganath.gitbook.io/data-structures/binary-search-tree/searching-in-a-bst.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.