while calculating no of unlabelled binary trees why they are same as no of bsts as in case of unlabelled bt there is no condition to have i-1 node on left side and n-i nodes on right side
Catlan nos difficulty
@Namanjain123
In case of BST for given n nodes, you can see that all the arrangements are different structure-wise, i.e. the structure of all the possibilites will be unique. (take n=3 and draw all the possibilities, and then just draw them again without giving the value to the node).
Similarly, in case of unlabelled binary trees, only the arrangement or structure matters.
So the answer will be same for both.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.