Create a Dictionary based on the lower ASCII characters 32 (Blank) through 128 (Euro). This will create a binary tree with 96 nodes. Using these techniques, create an encryption key for each character: * Starting at the root of the tree, search for the character. * As the search descends the tree: * If the character goes down the left side of the tree, encrypt a "0" * If the character goes down the right side of the tree, encrypt a "1" * When the character is found, include a consistent termination symbol in the encryption from the lower ASCII character set (for example "~"). 

For example: Suppose you have a tree of Numbers (0-9): [4] / \ [2] [5] / \ \ [1] [3] [7] / \ [6] [8] \ [9] 1: "00~" 2: "0~" 3: "01~" 4: "~" 5: "1~" 6: "110~" 7: "11~" 8: "111~" 9: "1111~" The numbers 1356 encrypted would read: "00~01~1~110~"