I think it will be solved using catalan number. using the formula 2(n-1)

No. of possible ordered trees with n nodes ? Please give
formula (if any).

Question Posted / rohit

Answer Posted / rohit

I think it will be solved using catalan number.
using the formula 2(n-1) C (n-1) /n;

Is This Answer Correct ?

8 Yes

4 No

Please Help Members By Posting Answers For Below Questions

Describe tree rotation in avl tree.

1041

Which is faster array or list?

970

Can arraylist be empty?

921

What member function places a new node at the end of the linked list?

1125

How to get largest and smallest number in an array?

1072

What do you mean by level of the tree?

1100

What are the different types of collections?

1023

Which sorting algorithm is considered the fastest?

1054

What is the structure of an array?

958

What is bubble sort algorithm in data structure sort and searching?

950

Is heap sort faster than quicksort?

880

What is data structure definition?

929

Difference between abstract data type, data type and data structure?

1102

Which sorting algorithm is the slowest?

899

What is the difference between length () and size () of arraylist?

962