This preview shows page 1. Sign up to view the full content.
Unformatted text preview: #L.0 #L(d, , )=l. #L.1 #L(d,t1,t2)= #L(t1)+ #L(t2)) The number of internal nodes of a binary tree, #I:: t #I.0 #I(d, , )=0. #I.1 #I(d,t1,t2)= #I(t1)+ #I(t2) +1 DEFINITIONS Let f and g be functions from N to R. Then f is asymptotically dominated by g (we say that f is O(g)) iff ( C,k: ( x x>k: f(x) Cg(x))) Let f and g be functions from N to R. Then f asymptotically dominates g (we say that f is (g)) iff ( C,k: ( x x>k: f(x) Cg(x))) Let f and g be functions from N to R. If f is O(g)) and f is (g)) then f is of order of g and we say f is (g). ( i 1 i n:i) = n(n+1)/2 ( i 0 i n:a i ) = (a n+11)/(a1)...
View Full
Document
 Fall '08
 Myers

Click to edit the document details