Count Unique Binary Search Trees | Dataford Interview Questions

Given an integer n, return the number of structurally unique binary search trees that can be formed using the distinct values 1 through n. Two trees are considered different if their structure differs, even if they contain the same set of values. The function should return a single integer.

Constraints

1 <= n <= 19
Values used are exactly the integers from 1 to n
The answer fits in a 32-bit signed integer

Function Signature

def num_trees(n):

Your question is Count Unique Binary Search Trees. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Constraints

1 <= n <= 19
Values used are exactly the integers from 1 to n
The answer fits in a 32-bit signed integer

Function Signature

def num_trees(n):

Your question is Count Unique Binary Search Trees. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.