2 Binary search tree Consider the following BSTNode structure that represents a binary search tree node, and the BSTree structure that represents a binary search tree. The root pointer points to the root node, and size book-keeps the number of items in the binary search tree. template struct BSTSede ( T data; BSTode left; BSTNederight: // BSTde parent; BSTNode (T d) : data (d), left (0), right (0)/, parent (0) / () // invariant 1 // (left taull) implies (left.data data) // invariant 2: (right sull) implies (data right.data) }; template struct BSTree ( BSTKode root; unsigned int size: BSTree () root (NULL), size (0) () BSTode insert (7 d); BSTKode find (T 4); min(); BSTKode BSTNode next (BSTBode current); void renove (BSTode node); //invariant: (root sull) equiv (size -- 0) Implement the insert and find methods. insert should insert element d in the tree, and find takes an element d and returns a pointer to the node that has d as value if it exists. Otherwise, it returns NULL. Implement the min, and next methods. min returns a pointer to the BSTNode with the minimum element in the tree, and next takes a pointer current to a BSTNode and returns the node that is next in order to current. Test the insert, min and next by inserting n integers into a BST and then retrieve them by calling in once followed by n-1 calls to next.

Java programming homework Please help me with this Question. I really need to understand it

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:…

Alert dont submit AI generated answer. Define a Binary Search Tree. Explain the advantage of a Binary Search Tree data structure. Create a Binary Search Tree (visually the way we did in the class) on the following input data. Show the status of the values during each step. NOTE: You have to describe the condition(s) used and the steps justifying the task of placing the value at a location. 34, 21, 43, 19, 20, 39, 19, 52