Tree Diagram Examples - Word Problems

Tree Diagram Examples

Tree diagrams find their use in probability theory. They can easily show the events are formed from more than one independent event. Tree diagrams are also used in decision trees, event trees. In a tree diagram, first the branching is done based on the first statement and then to the each of those branches, again branching is done based on the second statement.

Word Problems

Problem 1:

In a game, there are three doors A, B, C and 3 windows after each door to get to the next point. How many choices will be there for a person to get to the next point?

Solution:

The tree diagram will give the branching of doors first, and then for each door there will be branching of windows. Problem 2:

There are 4 Kings from a deck of card. One coin is tossed and one card is chosen from those 4 Kings. Find the sample space.

Solution:

The tree diagram for the sample space is given below. Problem 3:

An email comes in your email box which you will reply based on if it is urgent or not. Make a decision tree for this.

Solution:

Given is the decision tree showing process of taking the right step. Problem 4:

From building A to B there are three ways to go, and again from building B to A there are three ways. How many ways are there in total to go from building A to B and then return to building A from building B.

Solution:

Let us see the tree diagram. Total number of leaves are 9. Hence, there are 9 ways to go from A to B and then return to A from B.
{"ft_lang_label":"__label__en","ft_lang_prob":0.95415854,"math_prob":0.94710076,"size":1448,"snap":"2019-43-2019-47","text_gpt3_token_len":329,"char_repetition_ratio":0.13227147,"word_repetition_ratio":0.043010753,"special_character_ratio":0.22582872,"punctuation_ratio":0.11285266,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.991509,"pos_list":[0,1,2,3,4,5,6,7,8],"im_url_duplicate_count":[null,2,null,2,null,2,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-14T18:58:07Z\",\"WARC-Record-ID\":\"<urn:uuid:d04bef8c-fc6f-403a-a34b-2f90e0b0d83f>\",\"Content-Length\":\"17951\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2d4c9588-6af7-4f16-9215-2de5d241fc0e>\",\"WARC-Concurrent-To\":\"<urn:uuid:d1097f1a-0882-40bc-8f2c-57a60a45894f>\",\"WARC-IP-Address\":\"166.62.28.99\",\"WARC-Target-URI\":\"https://probabilityformula.org/tree-diagram-examples.html\",\"WARC-Payload-Digest\":\"sha1:JP4BD54GDNFLXE7T6KWPX5FAY2V3ISIU\",\"WARC-Block-Digest\":\"sha1:GRSGP72XVYNCUCQQC2JEMPLK473LUMII\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570986654086.1_warc_CC-MAIN-20191014173924-20191014201424-00415.warc.gz\"}"}