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 keys le

>>阅读原文<<