Data Structures Question:
How many different trees are possible with 10 nodes ?

Answer:
1014 - For example, consider a tree with 3 nodes(n=3), it will have the maximum combination of 5 different (ie, 23 - 3 =? 5) trees.
Previous Question | Next Question |
Minimum number of queues needed to implement the priority queue? | What is a data structure node class? |