We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Trees
  4. Is This a Binary Search Tree?
  5. Discussions

Is This a Binary Search Tree?

  • a_anofriichuk
     + 3 comments

    You can just perform DFS and check if data is in ascending order. No additional data structures/parameters needed. Just one static variable (yep, I am a C programmer :))

    bool checkBST(Node* root) {
    static int last_visited = -2;
        if (!root) {
            return true;
        }
        if (!checkBST(root->left)) {
            return false;
        }
        if (root->data <= last_visited) {
            return false;
        }
        last_visited = root->data;
        if (!checkBST(root->right)) {
            return false;
        }
        return true;
}