OSDN Git Service
(root)
/
oi-wiki
/
main.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
| inline |
side by side
(parent:
2444ec8
)
fix: fix equation
author
Margatroid
<i@margatroid.xyz>
Sat, 17 Aug 2019 01:08:58 +0000
(09:08 +0800)
committer
GitHub
<noreply@github.com>
Sat, 17 Aug 2019 01:08:58 +0000
(09:08 +0800)
docs/ds/avl.md
patch
|
blob
|
history
diff --git
a/docs/ds/avl.md
b/docs/ds/avl.md
index
5bb489c
..
a256f6c
100644
(file)
--- a/
docs/ds/avl.md
+++ b/
docs/ds/avl.md
@@
-11,10
+11,11
@@
AVL 树,是一种平衡的二叉搜索树。由于各种算法教材上对 AVL
**树高的证明** 设 $f_n$ 为高度为 $n$ 的 AVL 树所包含的最少节点数,则有
$$
+f_n=
\begin{cases}
-
f_1&=1
\\
-
f_2&=2
\\
-
f_n&=f_{n-1}+f_{n-2}+1\quad
(n>2)
+
1&(n=1)
\\
+
2&(n=2)
\\
+
f_{n-1}+f_{n-2}+1&
(n>2)
\end{cases}
$$