判断一棵树是否为二叉搜索树

A binary search tree (BST) is a node based binary tree data structure which has the following properties.

  • 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    .
    对二叉树进行中序遍历，判断该序列是否为升序序列
最后编辑于 ：
©著作权归作者所有,转载或内容合作请联系作者
平台声明：文章内容（如有图片或视频亦包括在内）由作者上传并发布，文章内容仅代表作者本人观点，简书系信息发布平台，仅提供信息存储服务。

推荐阅读更多精彩内容