How many different binary trees are possible with ' n ' nodes?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. (1/(n + 1))·C(2n, n)
Explanation
The number of structurally different binary trees with n nodes is the Catalan number C(2n, n)/(n + 1).
More Data Structures and Algorithms questions
- Let n be a positive integer and f(n) = 0 if n = 1, and f(n) = f(⌊n/2⌋) + 1 if n > 1. What is f(25), and what does the function compute?
- Given the FFT we can have ______ time procedure for multiplying two polynomials A(x) Q and B(x) of degree bound n where input and output re…
- Circuit satisfiability problem: given a Boolean combinational circuit of AND, OR and NOT gates, is it satisfiable (is there an input for wh…
- Given the expression (A + B * D)/(E − F) + G: 1. The prefix notation is + / + A * D B − E F G. 2. The prefix expression is the reverse of t…
- Match List I with List II
- Given the graph below one of the following edges cannot be added in that order to find a minimum spanning tree algorithm. Q I. a-b II. d-f…