edited by
334 views
1 votes
1 votes

A binary tree starts with a single root node at the top of the tree. Each node can have either a left child or a right child, or both, or neither. The children of a node are drawn below it, connected by edges. Here are the five possible binary trees with three nodes.

Note that the directions left and right of the children matter. In the second tree, the root has a left child that has a left child, while, in the fourth tree, the root has a left child that has a right child, and so on.

How many different binary trees can be constructed with four nodes?

  1. $13$
  2. $15$
  3. $14$
  4. $30$
edited by

1 Answer

Related questions

0 votes
0 votes
0 answers
1
admin asked Jul 23, 2022
213 views
Show that every selection of $503$ numbers from $\{1,2,3, \dots,987\}$ has two numbers with g.c.d. $1$. Recall that the g.c.d. of two positive integers $x, y$ is the larg...
2 votes
2 votes
1 answer
2
1 votes
1 votes
2 answers
3
admin asked Jul 23, 2022
314 views
The roots of the polynomial $p(x)=x^{4}-2x^{3}-2x^{2}+8x-8$ are:$1, -1, 2, 2+3 i$$1+i, 1-i, 2, -2$$1, -1+i, 2, 2+3 i$$1+i, -1+i, 2, -2$
0 votes
0 votes
1 answer
4