TreeNode left; TreeNode right; TreeNode parent; //optional } You have to implement the given functions in Binary search Tree class. 2. Binary Search Trees (BST) You are required to implement a Binary Search Tree (BST) ADT (Abstract Data Type). Following functionalities are expected. 2.1 Constructor Creates an empty Binary Search Tree. 2.3 Inserts a new node in BST (Standard Inser

All the methods as well as the main method/tester statements must be written in one class. DO NOT write a different class for each method. NOTE: USE PYTHON AD SOLVE BOTH QUESTIONS IF YOU WANT A THUMBS_UP. 1. Print elements of all the Nodes of a tree using In-order Traversal. 2. Print elements of all the Nodes of a tree using Post-order Traversal.

please write code both in java an python

I need help in converting the following Java code related to BST to a pseudocode.  public static class Node {        //instance variable of Node class        public String data;        public Node left;        public Node right;         //constructor        public Node(String data) {            this.data = data;            this.left = null;            this.right = null;        }    }     public void deleteANode(Node node) {        deleteNode(this.root, node);    }     private Node deleteNode(Node root, Node node) {        // check for node initially        if (root == null) {            return null;        } else if (node.data.length() < root.data.length()) {            // process the left sub tree            root.left = deleteNode(root.left, node);        } else if (node.data.length() > root.data.length()) {            // process the right sub tree            root.right = deleteNode(root.right, node);        } else if(root.data==node.data){            // case 3: 2 child…

Question 01: Implement the following UML class diagram. Student -name:String -address:String -numCourses: int - 0 -courses:String[30] = {} -grades:int[30] - (} +Student (name:String, address:String) +getName ():String +getAddress():String +setAddress (address:String):void +tostring():String •- +addCourseGrade(course:String,grade:int):void +printGrades ():void +getAverageGrade():double "name (address)" "name coursel:grade1, course2:grade2,..." Suppose that the application requires you to model students. A student has a name and an address. You are required to keep track of the courses taken by each student, together with the grades (between 0 and 100) for each of the courses. A student shall

comptuer sciecne help

Assume we have an IntBST class, which implements a binary search tree of integers. The field of the class is a Node variable called root that refers to the root element of the tree. 1) Write a recursive method for this class that computes and returns the sum of all integers less than the root element. Assume the tree is not empty and there is at least one element less than the root. 2) Write a recursive method that prints all of the leaves, and only the leaves, of a binary search tree. 3) Write a method, using recursion or a loop, that returns the smallest element in the tree.

Create a function that uses  Node * pointing to root of AVL Tree as an input and returns the height of the AVL tree in O(log(n)).

Which one is NOT an example of software reuse?     A I have an abstract class Game, I will define Chess, Backgammon, and Checkers as subclasses of class Game.   B I have a LinkedList implementation, I will use it to implement a Set class through delegation.   C I need to develop a structure that has recursive composition, I will make use of composite design pattern.   D I have already written a code segment that scans a list and finds duplicates, I will copy and paste that code segment into another program that I am developing.   E I have an implementation of List class which contains elements of type integer, I will use it to develop a list that contains elements of type Car.

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…