Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit 4f40e37

Browse files
committed
Update 01.Binary-Search-Tree.md
1 parent 97746c2 commit 4f40e37

File tree

1 file changed

+11
-0
lines changed

1 file changed

+11
-0
lines changed
Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
## 1. 二叉搜索树简介
2+
3+
> **二叉搜索树(Binary Search Tree)**:也叫做二叉查找树、有序二叉树或者排序二叉树。是指一棵空树或者具有下列性质的二叉树:
4+
>
5+
> - 如果任意节点的左子树不为空,则左子树上所有节点的值均小于它的根节点的值。
6+
> - 如果任意节点的右子树不为空,则右子树上所有节点的值均大于它的根节点的值。
7+
> - 任意节点的左子树、右子树均为二叉搜索树。
8+
9+
如图所示,这 `3` 棵树都是二叉搜索树。
10+
11+
![img](https://qcdn.itcharge.cn/images/20220218175944.png)

0 commit comments

Comments
 (0)