asked 4.7k views
4 votes
How many possible binary search trees can be made with the keys 1, 2, 3?

A)1

B)2

C)3

D)4

E)5

F)6

1 Answer

0 votes

Answer:

E) 5

Explanation:

(2 w/ 1 as root, 1 w/ 2 as root, 2 w/ 3 as root).

answered
User MTVS
by
8.4k points

No related questions found

Welcome to Qamnty — a place to ask, share, and grow together. Join our community and get real answers from real people.