Which is the correct Java implementation for a binary search tree's Node class? O O O class Node { public int key; public Node left; public Node right; public Node(int nodeKey) { key nodeKey; next = null; prev = null; } class Node { public int key; public Node next; public Node(int nodeKey){ key nodeKey; next = null; } class Node { public int key; public Node left; public Node right; public Node(int nodeKey){ key = nodeKey; left = null; right = null; } class Node { public Node key; public Node left; public Node right; public Node(int nodeKey) { key = null; left = null; right = null; }

class BSTNode  {      int key;      BSTNode left, right;        public BSTNode(int item) {            key = item;            left = right = null;      } }     class BST_Tree  {            BSTNode root;        BST_Tree()  {   // Constructor            root = null;      }       boolean search(int key){         return (searchRec(root, key) != null);     }          public BSTNode searchRec(BSTNode root, int key) {          if (root==null || root.key==key)            return root;              if (root.key > key)            return searchRec(root.left, key);              return searchRec (root.right, key);     }              void deleteKey(int key) {            root = deleteRec(root, key);      }      /* A recursive function to insert a new key in BST */      BSTNode deleteRec(BSTNode root, int key) {            /* Base Case: If the tree is empty */            if (root == null) return root;              /* Otherwise, recur down the tree */            if (key < root.key)…

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

In Java I'm trying to make a Red Black Tree through inheritance with the Binary Tree I created (as provided along with the Binary Node) yet I'm having a lot of difficulty knowing where and how to start as well as how to override and even create the Insert and Remove functions for the Red Black Tree. Code and assistance in this topic will be greatly appreciated... here is the code I'm utilizing for this project.   Binary Node I created: public class BinNode{private String data;private BinNode left;private BinNode right;private int height; //height fieldpublic BinNode(){data = "";left = null;right = null;}public int getHeight() {return height;}public void setHeight(int height) {this.height = height;}public BinNode(String d){data = d;left = null;right = null;}public void setData(String d){this.data = d;}public String getData(){return this.data;}public void setLeft(BinNode l){this.left = l;}public BinNode getLeft(){return this.left;}public void setRight(BinNode r){this.right = r;}public…