<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qq_45700975的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_45700975</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_45700975]]></copyright><item><title><![CDATA[判断是否为二叉排序树]]></title><link>https://blog.youkuaiyun.com/qq_45700975/article/details/128331501</link><guid>https://blog.youkuaiyun.com/qq_45700975/article/details/128331501</guid><author>qq_45700975</author><pubDate>Thu, 15 Dec 2022 16:22:37 +0800</pubDate><description><![CDATA[错误思想：若一棵非空的二叉树其左、右子树均为二叉排序树，且左子树的根小于根结点的值，根结点的值不大于右子树的根的值，则是二叉排序树。
正确算法
Int flag=0,last=0;		//last是全局变量，用来记录前驱结点值，只要每个结点都比前驱大就行
Int Is_BSTree(Bitree T)			//判断二叉树是否为二叉排序树，是则返回1，否则返回0
{
  if(T-&gt;lchild&amp;&amp;flag)
    Is_BSTree(T-&gt;lchild);			
  if(T-]]></description><category></category></item></channel></rss>