Write a method boolean isBST(Node root) that takes the root of a binary tree as a parameter and returns true if it is a valid binary search tree. Hint: Do a traversal. Do an in-order traversal to copy all elements into a List. Then check if the list is in increasing order.