You have to implement the following functions for the tree: 1) Insert This function will add a new student within the tree structure. Ask the user for student name and marks. 2) Display This function will print data of all students in the tree structure (use any traversal method). 3)Sorting

Tree.java: This is a simple binary tree class that should be used to represent the data in your Huffman tree. You only need to implement two of the methods (_printTree and compareTo). Huffman.java: This file contains all of the logic required to implement a Huffman tree. The code in this file relies on the Tree.java file. You must provide the implementation for all of the methods in this class. public class Main {     /*     * tree.txt should produce this tree:     * 16     * / \     * 6 Z     * / \     * A D     *     * A (1), D (5), Z (10)     *     * Codes:     * A: 00     * D: 01     * Z: 1     *     * Preorder Traversal:     * 16, 6, 1 (A), 5 (D), 10 (Z)     */    public static void main(String[] args) throws Exception {        Huffman huff = new Huffman();        huff.buildTreeFromFile("tree.txt");         // Print the tree:        System.out.println("printTree tests:");        huff.printTree(); // Expected output: [16: , 6: , 1:A, 5:D, 10:Z]         // Get some codes:…