Need help with complete Java Code.

A Binary Search Tree $($BST$)$ is a binary tree structure where each node adheres to specific

rules:

The left subtree of a node holds only nodes with keys lower than the node's key.

The right subtree of a node holds only nodes with keys higher than the node's key.

Both the left and right subtrees must also qualify as binary search trees.

Every node within the tree possesses a unique key.

Write a Java program that takes a binary tree of size n as input and check if the binary tree

is a Binary Search Tree $($BST$)$ or not. If the tree is a BST print "It's a Binary Search Tree" if

not print "It's not a Binary Search Tree".

Note: The input must be dynamic on each execution. Every time you run the program; the

program should ask you to input$-$

Binary tree of size $n.($Input the nodes of the binary tree in any order you prefer, but

you must specify in your code the sequence in which you intend to input the nodes

of the tree $($e$.$g$.,$ pre$-$order, level$-$by$-$level$)).$