### Table 3: Binary search tree

"... In PAGE 17: ... Table3 shows that if the elements are inserted in ascending order, the constructed tree is in fact a linear list where the element representing the minimum is at the root and the maximum at the end. The method getMax() is called twice in the postcondition, once to get the maximum of the old tree and once to get the maximum of the tree after inserting the new element.... ..."

### Table III. Type inference of Binary Search Trees

### Table 2: Examples of notations for a binary search tree in Figure 1.1

2006

### Table 4: Address (A) and Entry (E) Coverage for Mutating Binary Search

"... In PAGE 7: ... Thus each entry E in the search table could contain a descrip- tion of a search tree specialized for all prefixes that start with E. This simple optimization cuts the average search time to below two steps ( Table4 ), assuming probability proportional to the covered address space.... ..."

### Table 4: Address (A) and Entry (E) Coverage for Mutating Binary Search

"... In PAGE 7: ... Thus each entry E in the search table could contain a descrip- tion of a search tree specialized for all prefixes that start with E. This simple optimization cuts the average search time to below two steps ( Table4 ), assuming probability proportional to the covered address space.... ..."

### Table 2.4: Number binary symbols coded using trees created from difierent types of binary searches, applied to data source of Example 10. The trees corresponding to bisection and optimal searches are shown in Figures 2.3 and 2.4, respectively.

2004

### Table 3: Complete binary trees

1995

"... In PAGE 24: ... Things get worse for highly structured inputs. Table3 shows the behavior of the algo- rithm on complete binary trees. Here, the only parameter of the input is the height of the tree, ranging from height 8 (511 nodes) to 12 (8191 nodes).... In PAGE 24: ... Here, the only parameter of the input is the height of the tree, ranging from height 8 (511 nodes) to 12 (8191 nodes). As seen in Table3 pure parallelization behaves worse than the sequential algorithm in most of the cases considered. Indeed, the parallel phase produces only a small fraction of the result, and the completion phase in these cases is as costly as the sequential evaluation.... ..."

Cited by 4

### Table 1: Number of binary trees, composite trees and prime binary trees of given weight.

"... In PAGE 7: ...tatement is not true. The binary tree ( ( ( ))) has weight 4 and is a prime binary tree. It is easy to see that four of the ve binary trees of weight four are prime and that, in general, a natural number n is prime if and only if all binary trees of weight n are prime. In Table1 we give, for the rst values of n 1, the number Cn of binary trees of weight n, the number In of composite trees of weight n, and the number Pn of prime trees of weight n. It is well-known that the number of binary trees of weigth n is equal to the nth Catalan number Cn = (2n?2)!=(n!(n?1)!) (see [14], [12], [11] or [21]).... ..."