Term
Finding largest key in a binary search tree: worst case 

Definition


Term
Finding largest key in a binary search tree: average case 

Definition


Term
Deleting key from binary search tree: worst case 

Definition


Term
Deleting key from binary search tree: 

Definition


Term
Average case: Unsuccessful binary search 

Definition


Term
Worst case: Unsuccessful binary search 

Definition
(ceiling)log2(n+1)(/ceiling) 


Term
Average case: Successful binary search 

Definition


Term
Time efficiency of DFSbased algorithm for topological sorting for an adjacency matrix representation 

Definition


Term
Time efficiency of DFSbased algorithm for topological sorting for an adjacency linked list representation 

Definition


Term
Looking for a source in a digraph represented by an adjacency matrix (a column containing only zeros) 

Definition


Term
Looking for a source in a digraph represented by adjacency lists (a vertex appearing in none of the dag's adjacency linked lists) 

Definition

