Question

Q8 BST 15 Points Given a BST T with root r write algorithms (pseudocode) to determine: (a) The height of T. (b) The maximum element in T. (c) If T is height balanced. Please select file(s) Select file(s) Q9 Double 15 Points Consider inserting the keys 10, 22, 31, 4, 15, 28, 17, 88,59 into a hash tabl- (1) lend

Answer 1

a)

int findHeight(r) {
  if (r == null) return 0
  return 1 + max(findHeight(r.left), findHeight(r.right))
}

b)

int maxElement(r) {

temp = r;

while (temp.right != null) {

temp = temp.right;

}

return temp.value;

}

NOTE: As per HOMEWORKLIB POLICY I am allowed to answer specific number of questions (including sub-parts) on a single post. Kindly post the remaining questions separately and I will try to answer them. Sorry for the inconvenience caused.