首页 > 其他 > 详细

LeetCode OJ - Validate Binary Search Tree

时间:2014-05-23 12:20:32      阅读:374      评论:0      收藏:0      [点我收藏+]

题目:

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.

解题思路:

中序遍历二叉树,设置pre指针,在遍历过程中记录是否发生违反BST的节点的存在。

代码:

bubuko.com,布布扣
 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 };
bubuko.com,布布扣

 

LeetCode OJ - Validate Binary Search Tree,布布扣,bubuko.com

LeetCode OJ - Validate Binary Search Tree

原文:http://www.cnblogs.com/dongguangqing/p/3737271.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!