22 which choice is the result of a postorder

This preview shows page 6 - 10 out of 10 pages.

22.)Which choice is the result of a postorder traversal of the specified expression tree?A.C*E+F-D*L-K/X+ZB.CEF+*D-LK-XZ+/*C.*-*C+EFD/-LK+XZD.*-/*D-+C+LKXZEFE.Z+X/K-L*D-F+E*C*CX+-+*Z/-KEFDL
We have textbook solutions for you!
/Mathematics-A-Discrete-Introduction-3rd-Edition-9780840049421-1256/
The document you are viewing contains questions related to this textbook.
Chapter 9 / Exercise 47.18
Mathematics: A Discrete Introduction
Scheinerman
Expert Verified
CS 367 Spring 2004, Midterm 3P2004 Karen Miller and Deb Deppeler23.)Which rotation sequence would correctly rebalance this AVL tree?The last node added ismarked with diagonal lines.
page: 7 - 3P24.)What is the result of adding the value of 45 to this 2-3-4 tree?304050304045503040 504530 40455030404550ABCD3040 4550E
CS 367 Spring 2004, Midterm 3P2004 Karen Miller and Deb Deppeler25.)Which choice lists all vertices that have incorrect rows in the adjacency matrix for this graph?Note: rows are horizontal in this matrix.A B C D E F G H I J KA1 1 4 22B24C294D 191E 111F 4113G 23H3 3I312 2J 2421K11JI34GEHA9BCFD33111122224K12
page: 8 - 3P26.)Which of the following is a maxheap of integer values?861347591911101218141512345678910111278910111213ABCDE12345678910111256789101112131415161718
CS 367 Spring 2004, Midterm 3P2004 Karen Miller and Deb Deppelerpage: 9 - 3PPart III Written Answers[3 questions, 19 total points]Write your answers to the remaining questions in this examination booklet. If you need more room indi-cate where your work continues.27.)[6 points]Fill in the following table with tightest O( ) for the method's execution time for thespecified ADT. Give your answer in terms of n, where n is the number of items.28.)[6 points]The Wing and a Prayer Airline Company cannot keep up with quote requests for ticketprices, because the algorithm their computer program uses to determine fares is O(n3). They flyto thousands of cities, and a weighted graph of their routes gives fare prices for each leg of aflight. They have offered free airline tickets to anyone who can help them. How do you get thosefree tickets? Justify it in terms of O( ) efficiency.Complete for ADT:Binary Search TreeOperationarraylinked nodelook upaddremove
CS 367 Spring 2004, Midterm 3P2004 Karen Miller and Deb Deppelerpage: 10 - 3P29.)[7 points]Label this maze with characters for each vertex and draw the graph that represents thismaze. Use vertices to represent the start, end, decision points and dead ends. Use edges to repre-sent allowable paths from one vertex to the next.To get you started, the start has been labelled as ’A’ and the finish as ’Z’.Note: This does notmean there must be 26 vertices. If you need more than 26 labels, use strings such as "AA".AZ
End of preview. Want to read all 10 pages?

Upload your study docs or become a

Course Hero member to access this document

Term
Spring
Professor
MarvinSolomon
Tags
Graph Theory, Data Structures, b c d, Karen Miller, Deb Deppeler
We have textbook solutions for you!
The document you are viewing contains questions related to this textbook.
Mathematics: A Discrete Introduction
The document you are viewing contains questions related to this textbook.
Chapter 9 / Exercise 47.18
Mathematics: A Discrete Introduction
Scheinerman
Expert Verified

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture