java question, thank you

A binary search tree is a flexible and efficient data structure. However, as we discussed in class, the structure of the tree depends on the order in which the elements are inserted into the tree. In the worse cases, the binary search tree is no more efficient than linked lists. A left linear tree is such degenerated case Definition: A binary search tree is left linear if it contains at least one node and all the nodes of the tree have no right child Give (draw) an example of a left linear binary search tree having exactly 4 nodes. Implement the instance method boolean isLeftLinear() that returns true if the instance is left linear, and false otherwise public class BinarySearchTree > {private static class Node {private T value; private Node left; private Node right; private Node(T value) {this.value = value; left = null: right = null;}} private Node root = null