BST Checker

Validate if a binary tree is a proper Binary Search Tree (BST) with visual representation and detailed analysis

Request Feature / Support

8,688+

Total Calculations Run

< 15ms

Browser Execution Speed

100%

Client-Side Privacy

4.9 / 5.0

User Satisfaction

AI Web Tool Generator

Build Your Own Custom Web Calculator in Seconds

Type what tool or calculator you need below. Our AI will build it instantly for your site.

About This Tool

The BST Checker is a comprehensive tool that validates whether a given binary tree structure satisfies all Binary Search Tree (BST) properties. Enter node values in a structured format (like '5,3,7,2,4,6,8' or using parent-child notation) and the tool will check: 1) Left subtree contains only nodes with values less than the parent, 2) Right subtree contains only nodes with values greater than the parent, 3) Both left and right subtrees are also BSTs. The tool provides a visual tree representation, highlights violations, and displays detailed properties including tree height, node count, and validation status.

Save your calculation history with a free account

How to Use

Enter node values in the input field using comma-separated values (e.g., '10,5,15,3,7,12,18') or parent-child notation (e.g., '10:5,15;5:3,7').
Select the input format from the dropdown.
Click 'Check BST' to validate the tree.
View the visual tree representation with color-coded nodes (green for valid, red for violations).
See detailed results including validation status, tree properties, and any violations found.

Frequently Asked Questions

Find Quick Answers

What is a Binary Search Tree (BST)?

A Binary Search Tree is a binary tree data structure where each node has at most two children, and for every node: all values in the left subtree are less than the node's value, and all values in the right subtree are greater than the node's value.

What input formats does the tool support?

The tool supports two formats: 1) Comma-separated values representing level-order traversal (e.g., '5,3,8,2,4,7,9'), and 2) Parent-child notation (e.g., '5:3,8;3:2,4;8:7,9') where each parent lists its left and right children.

How does the tool visualize the tree?

The tool creates a visual tree representation using HTML5 Canvas, showing nodes as circles with values inside. Valid nodes are green, nodes violating BST properties are red, and edges show parent-child relationships.

What BST properties does the tool check?

The tool validates: 1) All nodes in the left subtree have values less than the parent node, 2) All nodes in the right subtree have values greater than the parent node, 3) Both left and right subtrees are also valid BSTs, 4) No duplicate values are allowed in a proper BST.

Can I check empty or single-node trees?

Yes, the tool handles edge cases: an empty tree (no nodes) is considered a valid BST, and a single-node tree is always a valid BST since it has no children to violate properties.

Need to run multiple calculations?

Create a free account today to unlock unlimited daily runs, access advanced parameters, save your history, and request custom features.

Related Tools

Other useful calculators and utilities you might like

Spotify to MP3 Converter

Convert Spotify tracks and playlists to MP3 format instantly with our free online converter.

Road Distance Calculator

Calculate the driving distance and travel time between two addresses with our free online road dista...

Age Calculator

Calculate your exact age in years, months, and days from any birth date to any target date.

Currency Converter

Convert currencies instantly with real-time exchange rates and historical data support.

Your Feedback Matters

Help Us to Improve