Assignment 4 Probs - Assignment #4 Due Date: Monday, March...

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

View Full Document Right Arrow Icon
Sheet1 Page 1 Assignment #4 Due Date: Monday, March 9 at 11:59pm Submit: WebCT Late Policy: -1 point per minute late Instructions: This is an individual assignment. Answers should be your own work. 12 points 1. Tree traversals. a. Give the sequence of letters from an inorder traversal of this tree: q / \ e r / \ \ d n s / \ / a c w Give the sequence of letters from these traversals of the tree below: b. a preorder traversal c. a postorder traversal q / | \ e f r / | /| | \ d n g h s t / | \ a b c 6 points 2. Draw an expression tree for the postfix expression: ab+c*ghij/+*+ 4 points 3. Use your expression tree to find the prefix expression. 6 points 4. Draw an AVL tree for the following values inserted in this order. Illustrate each rotation that occurs:
Background image of page 1

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

View Full DocumentRight Arrow Icon
Sheet1 Page 2 55 13 16 52 28 11 20 14 87 50 26 6 points 5. Draw an AVL tree for the following values inserted in this order. Illustrate each rotation that occurs: 93 12 68 55 32 6 46 57 62 92 6 points 6) For the splay tree shown below, show how an access of node 50 is performed.
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 09/16/2009 for the course CS 3345 taught by Professor Ozbirn during the Spring '08 term at University of Texas at Dallas, Richardson.

Page1 / 4

Assignment 4 Probs - Assignment #4 Due Date: Monday, March...

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