Number of possible ordered trees with 3 nodes a, b, c is
Answers
Answered by
0
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. Case B: The root node has one child, which is necessarily an ordered tree with two elements
Answered by
0
Answer:
12
Explanation:
for each node we can make 4 order.. so total 3*(4 for each)=12
Similar questions