Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Tree problems in depth

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Tree problems in depth

Validate Binary Search Tree

advancedlayer I2 · Tree problems in depth5 tests

Decide whether a binary tree is a valid binary search tree. In a valid BST, for every node, every value in its left subtree is strictly smaller than it and every value in its right subtree is strictly larger.

  • The rule covers whole subtrees, not just the immediate children
  • Duplicate values make a tree invalid
  • An empty tree and a single node are valid

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen