本质上是递归遍历左右后在与根节点做判断，本质上是后序遍历

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

给你一个二叉树，判断他是否是个有效的二叉查找树(BST)。

假定一个BST树按照下面的内容定义：

  • 左子树的节点的值都小于父节点。
  • 右子树的节点的值都大于父节点。
  • 左子树和右子树都得是合法的而二叉查找树。

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

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.
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
test.cpp：
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
  
#include <iostream>
#include <cstdio>
#include <stack>
#include <vector>
#include "BinaryTree.h"

using namespace std;

/**
 * Definition for binary tree
 * struct TreeNode {
 * int val;
 * TreeNode *left;
 * TreeNode *right;
 * TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
bool islessthanroot(TreeNode *left, int val)
{
    if(left == NULL)
    {
        return true;
    }
    if(left->val >= val)
    {
        return false;
    }
    return islessthanroot(left->left, val) && islessthanroot(left->right, val);
}

bool islargethanroot(TreeNode *right, int val)
{
    if(right == NULL)
    {
        return true;
    }
    if(right->val <= val)
    {
        return false;
    }
    return islargethanroot(right->left, val) && islargethanroot(right->right, val);
}

bool isValidBST(TreeNode *root)
{
    if(root == NULL)
    {
        return true;
    }
    if(islessthanroot(root->left, root->val) && islargethanroot(root->right, root->val))
    {
        return isValidBST(root->left) && isValidBST(root->right);
    }
    else
    {
        return false;
    }
}

// 树中结点含有分叉，
//                  6
//              /       \
//             2         7
//           /   \
//          1     4
//               / \
//              3   5
int main()
{
    TreeNode *pNodeA1 = CreateBinaryTreeNode(6);
    TreeNode *pNodeA2 = CreateBinaryTreeNode(2);
    TreeNode *pNodeA3 = CreateBinaryTreeNode(7);
    TreeNode *pNodeA4 = CreateBinaryTreeNode(1);
    TreeNode *pNodeA5 = CreateBinaryTreeNode(4);
    TreeNode *pNodeA6 = CreateBinaryTreeNode(3);
    TreeNode *pNodeA7 = CreateBinaryTreeNode(5);

ConnectTreeNodes(pNodeA1, pNodeA2, pNodeA3);
    ConnectTreeNodes(pNodeA2, pNodeA4, pNodeA5);
    ConnectTreeNodes(pNodeA5, pNodeA6, pNodeA7);

bool ans = isValidBST(pNodeA1);

if (ans == true)
    {
        cout << "Valid BST" << endl;
    }
    else
    {
        cout << "Not Valid BST" << endl;
    }

DestroyTree(pNodeA1);
    return 0;
}

 


结果输出：


Valid BST





BinaryTree.h:












1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21


 


#ifndef _BINARY_TREE_H_
#define _BINARY_TREE_H_


struct TreeNode
{
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};


TreeNode *CreateBinaryTreeNode(int value);
void ConnectTreeNodes(TreeNode *pParent,
                      TreeNode *pLeft, TreeNode *pRight);
void PrintTreeNode(TreeNode *pNode);
void PrintTree(TreeNode *pRoot);
void DestroyTree(TreeNode *pRoot);


#endif /*_BINARY_TREE_H_*/












BinaryTree.cpp:










1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89


 


#include <iostream>
#include <cstdio>
#include "BinaryTree.h"


using namespace std;


/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */


//创建结点
TreeNode *CreateBinaryTreeNode(int value)
{
    TreeNode *pNode = new TreeNode(value);


return pNode;
}


//连接结点
void ConnectTreeNodes(TreeNode *pParent, TreeNode *pLeft, TreeNode *pRight)
{
    if(pParent != NULL)
    {
        pParent->left = pLeft;
        pParent->right = pRight;
    }
}


//打印节点内容以及左右子结点内容
void PrintTreeNode(TreeNode *pNode)
{
    if(pNode != NULL)
    {
        printf("value of this node is: %d\n", pNode->val);


if(pNode->left != NULL)
            printf("value of its left child is: %d.\n", pNode->left->val);
        else
            printf("left child is null.\n");


if(pNode->right != NULL)
            printf("value of its right child is: %d.\n", pNode->right->val);
        else
            printf("right child is null.\n");
    }
    else
    {
        printf("this node is null.\n");
    }


printf("\n");
}


//前序遍历递归方法打印结点内容
void PrintTree(TreeNode *pRoot)
{
    PrintTreeNode(pRoot);


if(pRoot != NULL)
    {
        if(pRoot->left != NULL)
            PrintTree(pRoot->left);


if(pRoot->right != NULL)
            PrintTree(pRoot->right);
    }
}


void DestroyTree(TreeNode *pRoot)
{
    if(pRoot != NULL)
    {
        TreeNode *pLeft = pRoot->left;
        TreeNode *pRight = pRoot->right;


delete pRoot;
        pRoot = NULL;


DestroyTree(pLeft);
        DestroyTree(pRight);
    }
}












 


 


 


												


											
【二叉查找树】03验证是否为二叉查找树【Validate Binary Search Tree】的更多相关文章
	

    
						
  1. [Swift]LeetCode98. 验证二叉搜索树 | Validate Binary Search Tree
		
    Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as ...
    
		
    2. 
						
  2. [CareerCup] 4.5 Validate Binary Search Tree 验证二叉搜索树
		
    4.5 Implement a function to check if a binary tree is a binary search tree. LeetCode上的原题,请参见我之前的博客Va ...
    
		
    3. 
						
  3. Leetcode 笔记 98 - Validate Binary Search Tree
		
    题目链接:Validate Binary Search Tree | LeetCode OJ Given a binary tree, determine if it is a valid binar ...
    
		
    4. 
						
  4. leetcode dfs Validate Binary Search Tree
		
    Validate Binary Search Tree Total Accepted: 23828 Total Submissions: 91943My Submissions Given a bin ...
    
		
    5. 
						
  5. Validate Binary Search Tree
		
    Validate Binary Search Tree Given a binary tree, determine if it is a valid binary search tree (BST) ...
    
		
    6. 
						
  6. 【leetcode】Validate Binary Search Tree
		
    Validate Binary Search Tree Given a binary tree, determine if it is a valid binary search tree (BST) ...
    
		
    7. 
						
  7. LintCode Validate Binary Search Tree
		
    Validate Binary Search Tree Given a binary tree, determine if it is a valid binary search tree (BST) ...
    
		
    8. 
						
  8. 39. Recover Binary Search Tree  &&  Validate Binary Search Tree
		
    Recover Binary Search Tree OJ: https://oj.leetcode.com/problems/recover-binary-search-tree/ Two elem ...
    
		
    9. 
						
  9. 【LeetCode练习题】Validate Binary Search Tree
		
    Validate Binary Search Tree Given a binary tree, determine if it is a valid binary search tree (BST) ...
    
		
    10. 
						
  10. LeetCode: Validate Binary Search Tree  解题报告
		
    Validate Binary Search Tree Given a binary tree, determine if it is a valid binary search tree (BST) ...
    
		
    11. 
		

	


随机推荐
	

    
									
  1. RHEL7安装部署ZooKeeper
			
    转载请注明出处:jiq•钦's technical Blog - 季义钦 文章说明: 分布式注冊中心(链接)须要安装的组件包括两个部分: 1.注冊中心服务(Zookeeper) 2.站点(Tomcat ...
    
			
    2. 
						
  2. 脑法之中的一个 --- DEBUG与搜索算法
			
    前年闲的蛋疼的时候,看过天津卫视的一档节目<非你莫属>,就来一堆面试者,上面几个壕.选人.记得有一期是给程序猿做的.当中有一个程序猿(好像是媛)傻不啦叽的说,哎呀,我每次DEBUG找到程序 ...
    
			
    3. 
						
  3. iOS-Core-Animation-Advanced-Techniques（二）
			
    本文转载至 http://www.cocoachina.com/ios/20150104/10816.html 视觉效果和变换 (四)视觉效果 嗯,园和椭圆还不错,但如果是带圆角的矩形呢? 我们现在能 ...
    
			
    4. 
						
  4. Win7程序运行出现Windows Based Scrip Host 已停止工作问题的解决方法
			
    最近在使用类似于Teamviewer这样的程序时,突然运行不了,报错:Microsoft Windows Based Scrip Host 已停止工作的问题,从系统日志来看,好像是空指针问题,但是又无 ...
    
			
    5. 
						
  5. windowsphone8.1学习笔记之Toast通知
			
    熟悉或者了解wp系统的人都知道wp的Toast,Toast(吐司)通知是在屏幕最顶上弹出来的提示框,它专为与锁屏提醒.磁贴通知和应用中UI结合使用而设计,但它不是MessageDialog.说简单点它 ...
    
			
    6. 
						
  6. C#彻底解决Oledb连接Excel数据类型不统一的问题
			
    在使用Microsoft.Jet.OLEDB.4.0连接Excel,进行读取数据,相对使用传统的COM来读取数据,效率是很高的.但相对传统COM操作Excel来说,及存在数据类型转换的问题.因为使用O ...
    
			
    7. 
						
  7. Creation of SecureRandom instance for session ID generation using [SHA1PRNG] took [32,176] milliseco
			
    有一次,我启动tomcat时,居然花费了33秒.我不理解为什么一个新的tomcat,需要这么久, 网上查找后,找到了一个解决方法. # vim /usr/local/tomcat/bin/catali ...
    
			
    8. 
						
  8. L2 范数  L1 范数 出租车范数
			
    https://en.wikipedia.org/wiki/Norm_(mathematics) http://cs231n.github.io/classification/
    
			
    9. 
						
  9. Android开发之深入理解泛型extends和super的区别
			
    摘要: 什么是泛型?什么是擦除边界?什么是上界限定或下界限定(子类型限定或超类型限定)?什么是类型安全?泛型extends关和super关键字结合通配符?使用的区别,两种泛型在实际Android开发中 ...
    
			
    10. 
						
  10. ABAP 面向对象(Object Orientation) OO
			
    [转自 http://blog.sina.com.cn/s/blog_7c7b16000101bhof.html]在程序中, 对象的识别和寻址是通过对象引用来实现的, 对象引用变量可以访问对象的属性和 ...
    
			
    11.