<p><strong>Please help me implement the two search functions inBinarySearchTree.java </strong></p><p>public class BinarySearchTree<E extendsComparable<E>><br/>{</p><p>TreeNode<E> root;<br/>/**<br/>* Insert given node to this binary search tree. If this tree<br/>* is empty, the given node becomes
could help me to do the exercise 6.9 & 6.10 please,thanks<br/><img src="https://media.cheggcdn.com/media%2F39b%2F39bb1e9d-b2b6-44c3-aee9-32ed542a69b1%2Fimage" alt="69 Trace the action of HuffmanCode for the letters ab.c,d.e.fgh occurring with frequencies 10,7,3,5,9,2,3,2. 610 Given the Huffman