- 1. McCracken, D. D., Three "Lab Assignments" for an Algorithms Course, SIGCSE Bulletin 21 (1989), 61-64. Google Scholar
Digital Library
Index Terms
Computing average path lengths of binary search trees
Recommendations
Path Length of Binary Search Trees
An algorithm is given for constructing a binary tree of minimum weighted path length and with restricted maximum path length. (Huffman’s tree is a binary tree of minimum weighted path length with no restriction on maximum path length.) When an ...
Self-adjusting binary search trees
The splay tree, a self-adjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an n-node splay tree, all ...






Comments