cs114finalPractice

Cs114finalPractice - CS 114 Practice Exam Name For each of the trees below circle all descriptions that apply(assume heap stores largest value at

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

View Full Document Right Arrow Icon
CS 114 Practice Exam Name________________________________________________ For each of the trees below, circle all descriptions that apply: (assume heap stores largest value at the root) 1) a)full b)complete c)search tree d)heap e)balanced 2) a)full b)complete c)search tree d)heap e)balanced 3) a)full b)complete c)search tree d)heap e)balanced Page 1 of 7 40 20 50 10 80 10 40 20 50 70 40 80 10 60 80 90 30
Background image of page 1

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

View Full DocumentRight Arrow Icon
4) Using the tree from problem 3, write all the nodes using: a) preorder traversal b) inorder traversal c) postorder traversal 5) Draw the binary search tree that results from entering numbers in the following order: 60 30 10 90 20 80 70 6) What is the time complexity of the following sorting algorithms? Best case Worst case --------- ---------- BST remove --------- ---------- BST insert --------- ---------- BST find --------- ---------- Heapify --------- ---------- Heap Sort --------- ---------- Page 2 of 7
Background image of page 2
Using the 2-3 tree: Insert the value 32 and draw the resulting tree. Page 3 of 7
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 09/21/2009.

Page1 / 7

Cs114finalPractice - CS 114 Practice Exam Name For each of the trees below circle all descriptions that apply(assume heap stores largest value at

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

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