CIS1000C Chapter 8 Linear ADTs Lab Note: To get credit you must score 60 pts. or

CIS1000C
Chapter 8
Linear ADTs Lab
Note: To get credit you must score 60 pts. or higher
Name:
Sangeetha Matchanickal
Draw the binary search tree whose elements are inserted in the following order: (25 pts.)
50 72 96 94 107 26 12 11 9 2 10 25 51 16 17 95
If Print is applied to the tree formed in Exercise 1 in which order would the elements be printed? (10 pts.)
2 9 10 11 12 16 17 25 26 50 51 72 94 95 96 107
Trace the Binary Search algorithm to find an item whose value is 15 (25 pts.
CIS1000C
Chapter 8
Linear ADTs Lab
Note: To get credit you must score 60 pts. or higher
Name:
Sangeetha Matchanickal
Draw the binary search tree whose elements are inserted in the following order: (25 pts.)
50 72 96 94 107 26 12 11 9 2 10 25 51 16 17 95
If Print is applied to the tree formed in Exercise 1 in which order would the elements be printed? (10 pts.)
2 9 10 11 12 16 17 25 26 50 51 72 94 95 96 107
Trace the Binary Search algorithm to find an item whose value is 15 (25 pts.)
Tree
IsThere(tree item) call
50
1512 ; search right sub tree
25
15