validate-binary-search-tree.md

Validate Binary Search Tree

描述

Given a binary tree, determine if it is a valid binary search tree (BST).

Assume a BST is defined as follows:

• The left subtree of a node contains only nodes with keys less than the node's key.
• The right subtree of a node contains only nodes with keys greater than the node's key.
• Both the left and right subtrees must also be binary search trees.

分析

无

代码

{% codesnippet "./code/validate-binary-search-tree."+book.suffix, language=book.suffix %}{% endcodesnippet %}

相关题目

• Validate Binary Search Tree