finalkey - 1 A. / 12 / \ 8 15 \ 86 / 45 \ 90 2 B. 11 12 39...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
1 A. 15 / \ 12 86 / / \ 2 45 90 \ 8 B. 11 12 39 2010 101 7 28 13 2991 571 C. 2010 39 101 12 7 28 11 2001 13 571 D. 2010 101 39 28 7 12 2001 571 13 11 E. Average: O(1) or 1 or constant time or constant Worst: O(N) or N or linear time or linear F. O(1) or 1 or constant time or constant G. 26 H. % 100 or % 97 or % 101 or mod by length of array or mod by prime number closest to 100 I. 0 1 2 3 4 5 6 7 8 9 Kelly Mike Belle Olivia J. 18 16 14 12 10 K. 4 12 or compile error L. O(N log N) or N log N (if base 2 included okay) M. O(N^2) or N^2 N. yes O. O(N^2 log N) or N^2 log N (base 2 okay) or infinite P. O(N^2) or N^2 Q. 15 R. _______ ___________ | | | | | | | /| -|--- >| / | -|----| | | | | | | | ------- ----------- | ^ ^ ^ | | | |________| N1 N2 / indicates null S. 11
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
T. O(2 ^ N) or 2 ^ N U. descending order: O(N^2) or N^2 random order: O(N log N) or N log N (base 2 okay) V. III W. method shield counts the number of nodes in the binary tree with exactly two nonnull children (Or words to that effect)
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/30/2010 for the course CS 307 taught by Professor Scott during the Spring '08 term at University of Texas at Austin.

Page1 / 4

finalkey - 1 A. / 12 / \ 8 15 \ 86 / 45 \ 90 2 B. 11 12 39...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online