树堆
ujn20161222
persistence
展开
-
Cartesian Tree_树堆_2018_2_19
处理好标号Let us consider a special type of a binary search tree, called a cartesian tree. Recall that a binary search tree is a rooted ordered binary tree, such that for its every node x the ...原创 2018-02-19 21:28:45 · 274 阅读 · 0 评论 -
Heap_堆_2018_2_20
A (binary) heap is an array that can be viewed as a nearly complete binary tree. In this problem, we are talking about max-heaps.A max-heap holds the property that for each node than the ...原创 2018-02-20 09:04:03 · 117 阅读 · 0 评论