Code Development Given the following Java class fragment for a simple, non-Generic Bi- nary Search Tree class public class BinarySearchTree private class Node t public final int data; public Node left; public Node right; public Node (int data) [ this.data - data; private Node root; private int currentSize; public BinarySearchTree O root- null; currentSize - 0; public List inOrder) /I STUDENT CODE public static int height (Node root) t // STUDENT CODE 8. Method: public This method walks the binary search tree and returns a list of the tree's contents in ascending order List