# English text to Morse Code converter.

# Dictionary Implementation.

morseCodeLetters = {
    "A": ".-",
    "B": "-...",
    "C": "-.-.",
    "D": "-..",
    "E": ".",
    "F": "..-.",
    "G": "--.",
    "H": "....",
    "I": "..",
    "J": ".---",
    "K": "-.-",
    "L": ".-..",
    "M": "--",
    "N": "-.",
    "O": "---",
    "P": ".--.",
    "Q": "--.-",
    "R": ".-.",
    "S": "...",
    "T": "-",
    "U": "..-",
    "V": "...-",
    "W": ".--",
    "X": "-..-",
    "Y": "-.--",
    "Z": "--..",
    " ": " "
}

# print(morseCodeLetters.items())

# text = input("Enter some text in English.\n")
# # print(text, type(text))
# words = text.split()

# for word in words:
#     letters = list(word)
#     for letter in letters:
#         try:
#             morseSeq = morseCodeLetters[letter]
#             print(morseSeq, end="", flush=True)
#         except KeyError:
#             print("No morse sequence for character '" + letter + "'.")
#     print()

# Binary Tree implementation.

class Node:

    def __init__(self, symbol = None, letter = None):
        self.right = None
        self.left = None
        self.symbol = symbol
        self.letter = letter

root = Node()
root.left = Node("-", "T")
print(root.left.letter)