Why Validate if Tree is BST in DSA Typescript?

The Big Idea

What if you could instantly know if your tree is perfectly organized without checking every single node by hand?

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 one by one is tiring and confusing.

The Problem

Checking each node manually means you might miss some mistakes or spend hours comparing every child with its parent and other relatives. It's easy to get lost and make errors, especially if the tree is big.

The Solution

Using a simple step-by-step check called "Validate if Tree is BST" helps you quickly and correctly confirm if the tree follows the rules. It looks at each node and makes sure all left children are smaller and all right children are bigger, without missing anything.

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 method lets you confidently check large trees for correctness quickly and without mistakes.

Real Life Example

When building a search system, you want to make sure your data is organized correctly so you can find things fast. Validating a tree as a BST ensures your search will work perfectly.

Key Takeaways

Manual checks are slow and error-prone for big trees.

Validating BST uses simple rules to check all nodes efficiently.

This helps keep data organized and easy to search.