catalan – Tarik Billa

Finding all combinations of well-formed brackets

September 15, 2023 by Tarik

Took a crack at it.. C# also. public void Brackets(int n) { for (int i = 1; i <= n; i++) { Brackets(“”, 0, 0, i); } } private void Brackets(string output, int open, int close, int pairs) { if((open==pairs)&&(close==pairs)) { Console.WriteLine(output); } else { if(open<pairs) Brackets(output + “(“, open+1, close, pairs); if(close<open) Brackets(output + … Read more

With ‘ N ‘ no of nodes, how many different Binary and Binary Search Trees possible?

January 30, 2023 by Tarik

Total no of Binary Trees are = Summing over i gives the total number of binary search trees with n nodes. The base case is t(0) = 1 and t(1) = 1, i.e. there is one empty BST and there is one BST with one node. So, In general you can compute total no of … Read more