Create a method called equals for the BinaryTree class. This function should return true if and only if the trees have comparable shapes and refer to the same values (any Object, including the tree's Objects, has an equals method).

In python. Write a LinkedList class that has recursive implementations of the add and remove methods. It should also have recursive implementations of the contains, insert, and reverse methods. The reverse method should not change the data value each node holds - it must rearrange the order of the nodes in the linked list (by changing the next value each node holds). It should have a recursive method named to_plain_list that takes no parameters (unless they have default arguments) and returns a regular Python list that has the same values (from the data attribute of the Node objects), in the same order, as the current state of the linked list. The head data member of the LinkedList class must be private and have a get method defined (named get_head). It should return the first Node in the list (not the value inside it). As in the iterative LinkedList in the exploration, the data members of the Node class don't have to be private. The reason for that is because Node is a trivial class…

Write a method isBST() that takes a Node as argument and returns true if the argument node is the root of a binary search tree, false otherwise.Hint : This task is also more difficult than it might seem, because the order in which youcall the methods in the previous three exercises is important

Assume we already have class for binary search tree called BinarySearchT, you have access to the following methods (assume they are coded) public class BSTNode<E> { public int key; public E value; public BSTNode left; public BSTNode right; } public class BinarySearchT<E> { private BSTNode root; public void insert(int key, E value) { ... } public void delete(int key) { ... } public <E> find(int key) { ... } }   you are asked to only code a method public int treeH() to the BinarySearchT class that computes the height of the tree. Hint: You can use a helper method. Hints:  you should use a helper function I would do it with recursion  the key and value has no effect on this  remember what is the definition of the height  with respect the depths of nodes you can use Math.max(a,b) that would return the max between a and b, but if you prefer, you also can do it with loops  Note: make sure the name of the method matches