根据二叉排序树的定义，递归实现即可。

bool Judge(PBinTree pbt)
{
     PBinTreeNode   pLeft, pRight;
     bool    bLeft = false, bRight=false, bRootl=false, bRootr=false;

     if(pbt == NULL)
         return true;

     // 判断根节点
     pLeft = pbt->left;
     pRight = pbt->right;
     if(pLeft && pLeft->data <= pbt->data)
     {
          bRootl = true;
     }
     else
     {
           return false;
     }

     if(pRight && pRight->data >= pbt->data)
     {
          bRootr = true;
     }
     else
     {
          return false;
     }

     // 判断左右子树
     bLeft = Judge(pLeft);
     bRight = Judge(pRight);

     // 同时满足条件才叫二叉排序树
     return( bLeft && bRight && bRootl && bRootr);
}

评论