Write a code to implement binary search tree. Implement all the methods, find, insert, delete, minimum, max, find successor. Test out all the methods.

Create some code to see how well the Java HuffmanTree class performs.   The programme will have to parse a text and generate a frequency table of characters from that document.   Once the table is constructed, a Huffman code tree is made, and the file's code is represented by a string of '0' and '1' characters.   Then, using that string as a template, re-generate the original file's contents, and print them.

Answer the given question with a proper explanation and step-by-step solution.  Need lab6.py code please!

Implement a linked list of integers as aclass LinkedList. Build the following methods:✓ print that prints the content of the linked list;✓ addFirst that adds a new node to the beginning (the head) of thelinked list;✓ addLast that adds a new node to the end (the tail) of the linked list;✓ indexOf that finds a specific node by its value, and returns node’sindex (node’s position from the left in the linked list); if the valueis not present in the linked list, it returns −1;✓ deleteFirst that deletes the first node in the linked list;✓ deleteLast that deletes the last node in the linked list.Test your class creating a list in the main and1) adding one by one nodes 2, 4, 8 to the tail;2) adding nodes -2, -8 to the head;3) adding a node 9 to the tail;4) printing the list;5) printing indexOf(4);6) printing contains(9);7) deleting one by one all the nodes in the list – either from the tail orfrom the head – and printing the result after each deletion. THEN AFTER THIS Add a new method IN THE…