(PYTHON)

Write a program that implements and tests an AVL tree remove(item) method. This method accepts an item to remove. If the item is in the tree, the method removes the item, re-balances the tree, and returns True. If the item is not in the tree, False is returned. Bonus (6 pts) Read about Huffman coding. (1 pt) In a Huffman tree, the item with the highest frequency of occurrence will have a code with what trait? (5 pts) In the table below, fill in the code for each symbol shown in the following Huffman tree:

space 1