![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
二叉排序树
请多指教^_^
这个作者很懒,什么都没留下…
展开
-
Binary Search Heap Construction (笛卡尔树)
Binary Search Heap Construction 题目链接 Time Limit: 2000MS Memory Limit: 30000K Description Read the statement of problem G for the definitions concerning trees. In the following we define the basic terminology of heaps. A heap is a tree whose internal nodes原创 2020-11-03 23:40:20 · 221 阅读 · 0 评论 -
基础训练(四)BST二叉排序树
BST(poj:2309) 题目传送门 Time Limit: 1000MS Memory Limit: 65536K Description Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, … In a subtree whose root node is X, we can get the minimum number in this su原创 2020-10-18 21:32:27 · 225 阅读 · 0 评论