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:
19d7c82
)
maintain author
author
sshwy
<jy.cat@qq.com>
Fri, 30 Aug 2019 13:53:30 +0000
(21:53 +0800)
committer
sshwy
<jy.cat@qq.com>
Fri, 30 Aug 2019 13:53:30 +0000
(21:53 +0800)
docs/ds/cartesian-tree.md
patch
|
blob
|
history
diff --git
a/docs/ds/cartesian-tree.md
b/docs/ds/cartesian-tree.md
index
6103367
..
430b499
100644
(file)
--- a/
docs/ds/cartesian-tree.md
+++ b/
docs/ds/cartesian-tree.md
@@
-1,3
+1,5
@@
+author: sshwy, zhouyuyang2002, StudyingFather, Ir1d, ouuan, Enter-tainer
+
本文介绍一种不太常用,但是与大家熟知的平衡树与堆密切相关的数据结构——笛卡尔树。
笛卡尔树是一种二叉树,每一个结点由一个键值二元组 $(k,w)$ 构成。要求 $k$ 满足二叉搜索树的性质,而 $w$ 满足堆的性质。一个有趣的事实是,如果笛卡尔树的 $k,w$ 键值确定,且 $k$ 互不相同, $w$ 互不相同,那么这个笛卡尔树的结构是唯一的。上图: