Data Structures | Binary Search Trees | Question 4
How many distinct binary search trees can be created out of 4 distinct keys?
number of distinct BSTs = (2n)!/[(n+1)!*n!] .
Quiz of this Question
Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!