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

Is heap sort adaptive?

853

What is a hashmap in c?

888

What is array traversing?

896

Why do we need sorting algorithms?

935

Write a code for dynamic allocation of array.

1056

What is a graph?

2022

What is difference between array and arraylist? When will you use array over arraylist?

988

Which is faster hashset or treeset?

1020

What is an example of an array?

1054

How to initialize Dictionary using collection initialize?

1048

Define data type and what are the types of data type?

899

What is a string array?

928

How memory is reserved using a declaration statement in data structure?

1139

Does arraylist maintain insertion order?

840

Explain binary tree traversals?

931