Given a binary tree, determine if it is a valid binary search tree (BST).
Assume a BST is defined as follows:
中序遍历二叉树,设置pre指针,在遍历过程中记录是否发生违反BST的节点的存在。
1 /** 2 * Definition for binary tree 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), left(NULL), right(NULL) {} 8 * }; 9 */ 10 class Solution { 11 public: 12 13 TreeNode * pre = NULL; 14 bool isValidBST(TreeNode *root) { 15 if (root == NULL) return true; 16 17 if (root->left != NULL && !isValidBST(root->left)) return false; 18 if (pre != NULL && pre->val >= root->val) return false; 19 pre = root; 20 if (root->right != NULL && !isValidBST(root->right)) return false; 21 return true; 22 } 23 };
LeetCode OJ - Validate Binary Search Tree,布布扣,bubuko.com
LeetCode OJ - Validate Binary Search Tree
原文:http://www.cnblogs.com/dongguangqing/p/3737271.html