# Trees

 Exercise: Unordered Binary Trees For the following tree note the root, leaves and the left sub tree Answer: Root = 5 Left subtree = 2, 1, 4, 3 Leafs = 1, 3, 7, 9
 Exercise: Ordered Binary Trees To work out the following you begin at the root of the tree, if the second input is higher than the root it goes to the right of the root, whereas if it is lower than the root it goes to the left. the third input is then used, if it is higher than the root then it gets passed to the right, if there is already a input on this segment of the tree the input is compared with the input that is in there, if it is higher than the input it is passed to the right and if it is lower it is passed to the left, this process continues until all inputs have been dealt with and the tree is complete. Create a binary tree for the following data input: ```5, 2, 6, 8, 4, 1, 9, 7, 3 ``` Create a binary tree for the following major city input: ```Monaco, Paris, Vatican, Rome, Norwich, Lewisham, New York, Partington ``` Create a binary tree for the following list of animals: ```Elephant, Cat, Dog, Hippo, Giraffe, Lion, Bear ``` Answer: