Question
How many labeled binary tress can be made with n nodes?
Solution
Number of binary trees that can be made are(2nCn)/n+1 and when we want them labelled then we have to count for the arrangements as well so total number will ((2nCn)/n+1)*n! when combination is multiplied by n! that is the number of way we can do labeling.
More IT Networking Questions
? = 685.24 + 1024.97 – 9.992
- What approximate value will come in place of the question mark (?) in the following question? (Note: You are not expected to calculate the exact value.)
119.98% of 80.02 - 15.12 × 2.02 + 19.95 = ?
√3970 × √730 - √2400 = ?
– (8.002)³ + (30.001)² - (4.01)⁴ =?
45.45 × 11.67 + 14399.88 ÷ 8.01 + 124.79 = ?
600.11 ÷ 14.98 x 5.14 – 171.9 = √?
Determine the value of k such that the points A(2,3), B(4,k), and C(6,-3) lie on the same straight line.
540.11 ÷ 17.98 × 5.14 – 131.9 = √?
10.232 + 19.98% of 539.99 = ? × 7.99
