---

1.进行先序遍历，当左节点大于父节点或右节点小于父节点时说明不满足二叉搜索树的性质

2.

#define true 1

#define false 0

int isBinSearchTree(SqBiTree tree){

return prioTraverse(tree.SqBiTree,0,tree.ElemNum);

}

int prioTraverse(Elemtype* nodeArr, int current,int max){

if(current*2>=max){

return true;

}

int left = *nodeArr[(current＋1)*2-1];//左侧链路径:0->1->3->7->15->(i+1)*2-1

int current = *nodeArr[current]

int right = *nodeArr[(1＋current)＊2]//同理

int resl = false;

int resr = false;

if(left != -1 && left < current){

 resl = prioTraverse(nodeArr,(current+1)*2-1,max);

}

if(right != -1 && right > current){

resr=prioTraverse(nodeArr,(current+1)*2,max);

}

return resl && resr;／／有一边不满足要求，则整颗树不满足要求

}

---