How many Binary Search Trees are there which have N nodes and their height is log N ? We need a recursive function to solve this problem. For example if n=2 the answer is 2. If n=3 answer is 1 . If n=4 answer is 6. I tried to find how many trees with n nodes can we construct that their height is log N. And we know the inorder traverse of a binary serach tree give us a sorted list of nodes. So for each form of tree with log N height we have one arrangement for elements

  • $\begingroup$ What did you try? Where did you get stuck? We're happy to help you understand the concepts but just solving exercises for you is unlikely to achieve that. You might find this page helpful in improving your question. Have you tried oeis.org? $\endgroup$ – D.W. Jan 20 at 18:15

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.