BST Search Operation in DSA Go - Time & Space Complexity

Time Complexity: BST Search Operation

O(h)

Understanding Time Complexity

We want to understand how long it takes to find a value in a Binary Search Tree (BST).

How does the search time change as the tree grows bigger?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

func SearchBST(root *TreeNode, val int) *TreeNode {
    if root == nil || root.Val == val {
        return root
    }
    if val < root.Val {
        return SearchBST(root.Left, val)
    }
    return SearchBST(root.Right, val)
}
    

This code searches for a value in a BST by moving left or right depending on comparisons.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Recursive calls moving down one level of the tree.
• How many times: At most once per tree level until the value is found or a leaf is reached.

How Execution Grows With Input

Each step moves down one level, so the number of steps depends on the tree's height.

Input Size (n)	Approx. Operations (steps)
10 nodes	About 4 steps (if balanced)
100 nodes	About 7 steps (if balanced)
1000 nodes	About 10 steps (if balanced)

Pattern observation: In a balanced tree, steps grow slowly (logarithmically) as nodes increase.

Final Time Complexity

Time Complexity: O(h) where h is the tree height

This means the search time depends on how tall the tree is, not just how many nodes it has.

Common Mistake

[X] Wrong: "Searching a BST always takes O(n) time because you might check every node."

[OK] Correct: In a balanced BST, you skip half the nodes each step, so search is much faster, about O(log n). Only in a very unbalanced tree does it become O(n).

Interview Connect

Understanding BST search time helps you explain how data structures speed up finding information, a key skill in coding interviews.

Self-Check

"What if the BST is completely unbalanced and looks like a linked list? How would the time complexity change?"

Practice

1. What does the search operation in a Binary Search Tree (BST) do?

easy

A. Finds whether a given value exists in the BST

B. Deletes a node from the BST

C. Inserts a new node into the BST

D. Traverses all nodes in the BST

Solution

1. Step 1: Understand the purpose of BST search

   The search operation is designed to check if a specific value is present in the BST.

2. Step 2: Differentiate from other operations

   Insertion adds nodes, deletion removes nodes, and traversal visits nodes. Search only checks for existence.

3. Final Answer:

   Finds whether a given value exists in the BST -> Option A

4. Quick Check:

   Search = Find value [OK]

Hint: Search checks presence, not insertion or deletion [OK]

Common Mistakes:

• Confusing search with insert or delete
• Thinking search returns the node always
• Assuming search traverses all nodes

2. Which of the following is the correct Go function signature for a BST search method that returns a boolean indicating if a value exists?

easy

A. func Search(val int) *Node

B. func (root *Node) Search(val int) bool

C. func (root Node) Search(val string) bool

D. func Search(root Node, val int) int

Solution

1. Step 1: Identify method receiver and return type

   BST search is usually a method on a pointer to Node and returns bool for found or not.

2. Step 2: Check parameter types and return type

   func (root *Node) Search(val int) bool uses pointer receiver, int parameter, and bool return which matches the expected signature.

3. Final Answer:

   func (root *Node) Search(val int) bool -> Option B

4. Quick Check:

   Pointer receiver + bool return = func (root *Node) Search(val int) bool [OK]

Hint: Search returns bool, uses pointer receiver for tree nodes [OK]

Common Mistakes:

• Using value receiver instead of pointer
• Wrong parameter or return types
• Confusing method vs function signatures

3. Given the BST below and the Go code snippet, what will be the output? BST structure: ``` 10 / \ 5 15 / 3 ``` Go code:

found := root.Search(3)
fmt.Println(found)

medium

A. true

B. false

C. nil

D. runtime error

Solution

1. Step 1: Trace the search for value 3 in the BST

   Starting at root 10, 3 < 10, go left to 5; 3 < 5, go left to 3; found node with value 3.

2. Step 2: Understand the returned value and print output

   Search returns true because 3 exists; printing true outputs 'true'.

3. Final Answer:

   true -> Option A

4. Quick Check:

   3 found in BST = true [OK]

Hint: Follow BST left/right rules to find value [OK]

Common Mistakes:

• Assuming search returns node instead of bool
• Confusing true/false output
• Ignoring BST structure when tracing

4. The following Go code for BST search has a bug. What is the bug?

func (root *Node) Search(val int) bool {
    if root == nil {
        return false
    }
    if root.Value == val {
        return true
    }
    if val < root.Value {
        return root.Search(val)
    } else {
        return root.Search(val)
    }
}

medium

A. Base case for nil root is missing

B. Uses value receiver instead of pointer

C. Returns int instead of bool

D. Recursive calls do not move to left or right child nodes

Solution

1. Step 1: Analyze recursive calls in search method

   Both recursive calls use root.Search(val) without moving to root.Left or root.Right, causing infinite recursion.

2. Step 2: Identify correct recursive calls

   Should call root.Left.Search(val) if val < root.Value, else root.Right.Search(val) to move down the tree.

3. Final Answer:

   Recursive calls do not move to left or right child nodes -> Option D

4. Quick Check:

   Recursive calls must move down tree [OK]

Hint: Recursive calls must go to left or right child [OK]

Common Mistakes:

• Calling search on same node causing infinite loop
• Missing base case for nil
• Wrong return types

5. You want to search for a value in a BST but also count how many nodes you visited during the search. Which modification to the search function is best?

hard

A. Use a global variable to count nodes visited during search

B. Return the node instead of bool and count nodes outside the function

C. Add a counter parameter passed by pointer and increment it on each node visited

D. Modify the BST to store counts in each node

Solution

1. Step 1: Understand the need to count nodes during search

   Counting nodes visited requires tracking each node checked during recursion.

2. Step 2: Choose method to count nodes visited

   Passing a pointer to a counter variable and incrementing it at each node visit allows accurate counting without side effects.

3. Final Answer:

   Add a counter parameter passed by pointer and increment it on each node visited -> Option C

4. Quick Check:

   Pass counter pointer to track visits [OK]

Hint: Pass counter pointer to track nodes visited [OK]

Common Mistakes:

• Using global variables causing side effects
• Counting outside search missing recursive visits
• Changing BST structure unnecessarily