LeetCode刷题笔录 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.Th
原创
2014-04-09 15:15:58 ·
6809 阅读 ·
2 评论