how many distinct binary search trees can be created out of 4 distinct keys?
Welcome to the solution site, which is interested in answering educational questions, as it provides an wanser to your questions in all areas
The solution site is concerned with questions, answers and solutions for all study materials for all levels
Through the word “Ask a Question” at the top of the site, you can ask any topic or any question or inquiry you want answered by users specialized
to solving questions and educational and academic activities that you ask
Now let’s answer your question
how many distinct binary search trees can be created out of 4 distinct keys?
answer :Hence, the total no of binary trees with n=4 is 14.