#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
typedef struct node
{
int data;
struct node *lc, *rc;
} LNode, *BiTree;
int preData = -9999;
int isBst(BiTree b)
{
int b1, b2;
if (b == NULL) //空树
{
return 1;
}
else
{
b1 = isBst(b->lc);
if (b1 == 0 || preData >= b->data)
{
return 0;
}
preData = b->data;
b2 = isBst(b->rc);
return b2;
}
}
判断二叉树是否为有序二叉树
最新推荐文章于 2024-08-21 14:24:26 发布