Dsa
Trees
Easy
Unique Binary Trees Count
Given an integer n, return the number of structurally unique binary search trees (BST) that can be constructed with n distinct nodes. Each node can hold a distinct integer value ranging from 1 to n.
Example:
Input:
3
Output:
5
Input format:
An integer n (1 <= n <= 19)
Output format:
An integer representing the number of unique BSTs.
Key concepts
treescombinatorics
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now