[LeetCode]98.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 keysless thanthe node's key. The

>>阅读原文<<