Write code in java

9:03 B 46% 404 Lab#13 - updated - Read-only [ : LAB#13 OPEN ENDED LAB-|| Objective You are given a binary tree with integers as its keys. You need to test whether it is a correct binary search tree. The definition of the binary search tree is the following: for any node of the tree, if its key is x, then for any node in its left sub-tree its key must be strictly less than x, and for any node in its right sub-tree its key must be strictly greater than x. In other words, smaller elements are to the left, and bigger elements are to the right. You need to check whether the given binary tree structure satisfies this condition. You are guaranteed that the input contains a valid binary tree. That is, it is a tree, and each node has at most two children. Algorithm Source Code Results Conclusion =