摘要：
1. BST只保存preorder或者postorder就够了，递归有O(n^2)和O(n)算法。非递归有利用栈的O(n)算法。2. Complete binary treelevel traversal就行了。3. Full binary tree用一个bit来保存该结点是internal nod... 阅读全文
摘要：
What is a high-performance data structure? To answer that question, we're used to applying normal considerations like Big-Oh complexity, and memory ov... 阅读全文