# Decision Tree

Omedi wants to get from point A to some point on the subway (represented by the thick dotted line). At each intersection, he can decide to go either south or east. How many different paths can he take? Draw a decision tree representing the different possible paths.

p24.JPG
###### Who is Participating?

Commented:

A---->--- B --->----C
|             |            |
D---->---E---->----F
|             |            |
H---->----I ---->---J

The graph you want is as above, (all vertical edges directed downwards)

Now form the decision tree starting from A, (as in the last question), but terminate at any leaf when you hit either

H, I, J, F or C

The number of paths is the number of leaves.

I can't do more than that else I am doing the question.
0

Commented:
To be technically correct he graph is actually this, as once you hit the subway you are done

A---->--- B --->----C
|             |
D---->---E---->----F
|             |
H            I
0

Author Commented:
Thanks.
0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.