* As we designed the binary tree to be universal adding to the tree is very easy in theory we just add a few more characters to the array in **initTree()** in breadth first order. However, when we dive into it we quickly see that the array becomes very long. This isn't efficient todo by hand. I have created a programme todo it for us.
****inserter.py** is designed to take an heap string and add values to that heap. It also will add new layers by adding the correct amount of Null characters. This is what the tree looks like in heap form now.. The function to insert is very simple and the next worksheet builds on a similar method so it will be very useful.  When we run our new characters to be inserted  we get .
****morse.py** To simple update the binary tree with new values we just add it to **initTree()** like this. 
****inserter.py*** is designed to take an heap string and add values to that heap. It also will add new layers by adding the correct amount of Null characters. This is what the tree looks like in heap form now.. The function to insert is very simple and the next worksheet builds on a similar method so it will be very useful.  When we run our new characters to be inserted  we get .
****morse.py*** To simple update the binary tree with new values we just add it to **initTree()** like this. 
****unittesting*** after testing some of the new values we get no unexpected errors. 
