Coursera Algorithms week4 基础标签表 练习测验：Check if a binary tree is a BST

题目原文：

Given a binary tree where each  𝙽𝚘𝚍𝚎 contains a key, determine whether it is a binary search tree. Use extra space proportional to the height of the tree.

分析：

就是递归遍历BST，将每个节点x分别与x.left和x.right比大小。

public boolean isBST(BST<Key,Value> bst){
    return isBST(root);
}
private boolean isBST(Node x){
    if(x.left.key.compareTo(x.key) != -1) return false;
    if(x.key.compareTo(x.right.key)!= -1) return false;
    if(x.left != null ) return isBST(x.left);
    if(x.right != null ) return isBST(x.right);
    return true;
}