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

2023年11月19日 215次阅读 来源: lintong

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    .
    对二叉树进行中序遍历，判断该序列是否为升序序列
    原文作者：lintong
    原文地址: https://www.jianshu.com/p/3732c43db77f
    本文转自网络文章，转载此文章仅为分享知识，如有侵权，请联系博主进行删除。
点赞