# Find Mode In Binary Search Tree: Study Guide

Find Mode In Binary Search Tree is a common tree question in coding rounds. Below is how I talk through it in an interview setting.

## Key idea

Inorder traversal groups equal values together; count runs and keep the best run length without an extra hash map.

## Steps to say out loud

1. Restate the input and output, and ask about empty trees and duplicate values.
2. Name the traversal (DFS or BFS) and what each call returns.
3. Code it, then trace a three-node example by hand.

## Complexity

O(n) time, O(1) extra besides recursion.

## Common mistake

Resetting the run counter incorrectly when the value changes.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edge cases. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI coding interview assistant.