Why Validate if Tree is BST in DSA Javascript?

The Big Idea

What if you could instantly know if your tree is perfectly organized without guessing?

The Scenario

Imagine you have a family tree drawn on paper, and you want to check if it follows a special rule: every child on the left is smaller than the parent, and every child on the right is bigger. Doing this by looking at each person and comparing them manually is tiring and confusing.

The Problem

Checking each node by hand means you might miss some mistakes or get confused about which numbers to compare. It takes a lot of time and you can easily make errors, especially if the tree is big or complicated.

The Solution

Using a smart method to check the tree automatically saves time and avoids mistakes. This method looks at each node and makes sure it fits the rule by comparing it with allowed minimum and maximum values, moving down the tree step by step.

Before vs After

✗ Before

function isBST(node) {
  if (!node) return true;
  if (node.left && node.left.value >= node.value) return false;
  if (node.right && node.right.value <= node.value) return false;
  return isBST(node.left) && isBST(node.right);
}

✓ After

function isBST(node, min = -Infinity, max = Infinity) {
  if (!node) return true;
  if (node.value <= min || node.value >= max) return false;
  return isBST(node.left, min, node.value) && isBST(node.right, node.value, max);
}

What It Enables

This lets you quickly and correctly check if a tree follows the special order rules, even for very large trees.

Real Life Example

When building a search system, you want to make sure your data is organized correctly so you can find things fast. Checking if your tree is a BST helps keep your search system working well.

Key Takeaways

Manual checking is slow and error-prone.

Using min/max limits helps verify the tree correctly.

This method works well even for big trees.