How many different trees are possible with 10 nodes ?
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.
If you liked this question/asnwer, make sure you
Subscribe to KyaPoocha.com RSS feed!
BOOKMARK THIS : BlinkList | del.icio.us | Digg it | Furl | reddit | StumbleUpon | Yahoo MyWeb |
Related Interview Questions
How do you find out if a linked-list has an end? (i.e. the list is not a cycle) 07.11.08
You can find out by using 2 pointers. One of them goes 2 nodes each time. The second one goes at 1 nodes each time. If there is a cycle, the one that goes 2 no...What is a Tree? 29.10.08
A tree is a data structure where data is stored in nodes. Nodes are arranged in branches where each node can expand into 0, 1, or 2 other nodes...._______ is the maximum number of nodes that you can have on a stack-linked list. 29.10.08
There can be a nearly unlimited number of nodes on a stack-linked list, restricted only by the amount of available memory in the computer....How do you find out if a linked-list has an end? (i.e. the list is not a cycle) 04.05.07
You can find out by using 2 pointers. One of them goes 2 nodes each time. The second one goes at 1 nodes each time. If there is a cycle, the one that goes 2 nod...What is Linked List ? 12.12.06
Linked List is one of the fundamental data structures. It consists of a sequence of nodes, each containing arbitrary data fields and one or two ("links") poin...What is Two-Phase Commit? 14.11.06
Two-phase commit is mechanism that guarantees a distributed transaction either commits on all involved nodes or rolls back on all involved nodes to maintain dat...How do you find out if a linked-list has an end? (i.e. the list is not a cycle) 18.07.06
You can find out by using 2 pointers. One of them goes 2 nodes each time. The second one goes at 1 nodes each time. If there is a cycle, the one that goes 2 nod...What are the advantages and disadvantages of B-star trees over Binary trees? 18.07.06
B-star trees have better data structure and are faster in search than Binary trees, but it's harder to write codes for B-start trees....What is a spanning Tree? 09.03.06
A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so...In RDBMS, what is the efficient data structure used in the internal storage representation? 09.03.06
B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier. This corresponds to the records that shall be stored in lea...