Python

An anagram is a permutation of the letters of a word to produce another word. The method print_anagram show below prints all the anagrams of a given word. To do this, it generates all permutations of the letters in the word and, for each permutation, it checks if it is a valid word in the English language. For example, if you call print_anagrams(spot), the method should print the following words: spot, stop, post, pots, opts, and tops

def print_anagrams(word, prefix=""): if len(word)

The method uses a data structure called engish_words to determine if a given anagram is a valid word in the English language. You can think of engish_words as a container of all the words in the English language. We will implement this data structure using a binary search tree. To populate engish_words, we will use a text file called words.txt that contains English words.

Write a function that reads the file and populates the binary search tree with all the English words contained in the file. Ask the user what type of binary search tree he/she wants to use (AVL Tree or Red-Black Tree).

words.tt -- File Edit Format View rigs rig s rigsby Rigsdag rigsdaler Rigsmaal Rigsmal rigueur rig-up Rigveda Rig-Veda Rigvedic Rig-vedic rigwiddy rigwiddie rigwoodi Riha Rihana RIIA Riyadh riyal Help words.tt -- File Edit Format View rigs rig s rigsby Rigsdag rigsdaler Rigsmaal Rigsmal rigueur rig-up Rigveda Rig-Veda Rigvedic Rig-vedic rigwiddy rigwiddie rigwoodi Riha Rihana RIIA Riyadh riyal Help