Computer Science, asked by DevasyaG1083, 1 year ago

The number of possible ordered trees with 3 nodes a b c is

Answers

Answered by Anonymous
0

Case A: The root node has two children, each of which is an ordered tree with two elements. There are two ways we could order the two remaining nodes. So there are 3*2 = 6 possible ordered trees with three nodes given that the root node has two children

Answered by Anonymous
7

Case A: The root node has two children, each of which is an ordered tree with two elements. There are two ways we could order the two remaining nodes. So there are 3*2 = 6 possible ordered trees with three nodes given that the root node has two children.

Similar questions
Math, 6 months ago