摘要：
我打算发一下自己对于算法导论书里面的个人答案。欢迎大家指正。因为读的是英文版，这里也用英文来发吧：）12.1 What is a binary search tree12.1-1:12.1-2:BSP Property: Let x be a node in BST, if y is a node in the left subtree of x, then:key[x]>= key[y]; if y is a node on the right subtree of x, then key[x]<=key[y].Min-Heap Property: for any node x, 阅读全文
