# 7

Binary Search Trees are an essential part of computer science and are frequently asked about in interviews. Let's dive into the top 7 BST coding problems you should know for your next interview.

## Introdution

Want to practice BST Interview problems?

Given a matrix of integers sorted row-wise and column-wise, efficiently search for an element in the matrix.

## 1. Matrix Search

Given an integer A, Compute and return the square root of A without using sqrt function from the standard library. If A is not a perfect square, return floor(sqrt(A)).

## 2. Square Root of Integer

Want to practice BST Interview problems?

Given an array of board lengths, A painters, & B units of time per 1 unit of board, find minimum time required to paint all boards where each painter can only paint contiguous sections of board.

## 3. Painter's Partition Problem

Want to practice BST Interview problems?

Given two sorted arrays, find the median element of the merged array. The overall run time complexity should be O(log (m+n)).

## 4. Median of Array

Want to practice BST Interview problems?

Given a sorted array that has been rotated, search for a target element efficiently. You may assume no duplicate exists in the array.

## 5. Rotated Sorted Array Search

Want to practice BST Interview problems?

Given a base and an exponent, compute the value of the base raised to the exponent.

## 6. Implement Power Function

Want to practice BST Interview problems?

Given a sorted array of integers and a target value, find the starting and ending position of the target value in the array.

## 7. Search for a Range

Want to practice BST Interview problems?

### InterviewBit has got you covered with their collection of Binary search tree interview problems. Get started now and become a master problem solver!

Ready to become expert in solving BST Problems?

Step Up Your Game with InterviewBit Web Stories