Consider the list of values L = [5,7,3,9,8,1,4,5,9,3,5,0,10]. a) construct/draw a binary search tree using the values in the list L b) list all the leaf nodes c) what is the depth of this binary...

Extracted text: Consider the list of values L = [5,7,3,9,8,1,4,5,9,3,5,0,10]. a) construct/draw a binary search tree using the values in the list L b) list all the leaf nodes c) what is the depth of this binary search tree (assume root at zero depth) d) justify why or why not this tree represents a complete complete binary tree