# Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

3 Pages

### exercise_7

Course: CS 201, Fall 2008
School: Ill. Chicago
Rating:

Word Count: 219

#### Document Preview

Exercise 6 for Trees &amp;amp; Graphs 1. In Figure1 a) Which node is the root? b) Which nodes are leaves? c) Name the parent node of J; d) List the siblings of H; e) List the left child of node E; 2. In Figure 1 a) Give the level of node I; b) Give the depth of the tree; c) List the subtree whose root is E. 3. Give the pre-order, in-order, post-order, level-order tree traversal sequences for the expression...

Register Now

#### Unformatted Document Excerpt

Coursehero >> Illinois >> Ill. Chicago >> CS 201

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Exercise 6 for Trees &amp; Graphs 1. In Figure1 a) Which node is the root? b) Which nodes are leaves? c) Name the parent node of J; d) List the siblings of H; e) List the left child of node E; 2. In Figure 1 a) Give the level of node I; b) Give the depth of the tree; c) List the subtree whose root is E. 3. Give the pre-order, in-order, post-order, level-order tree traversal sequences for the expression tree in Figure 2. 4. Give the array-based tree representation of Figure 2. 5. Show that in a binary tree of N nodes, there are N+1 NULL links representing children. 6. Finding a topological ordering for the graph in Figure 3. 7. Finding the shortest path from A to all other vertices for the graph in Figure 4. 8. Give the adjacency list and adjacency matrix for the undirected graph in Figure 5. 9. Following the stack implementation of DFS and the queue implementation of BFS (see lecture notes), draw a table for each procedure to show the detailed operations of DFS and BFS for the graph in Figure 5. The start point is A. A B C D E G H I J Figure 1 - * e * + a b c d Figure 2 A s D t G Figure 3 H 1 5 A 2 B G 3 C 7 1 3 D 6 Figure 4 F A B E D I J 1 7 G H Figure 5 2 2 E C
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Ill. Chicago - CMENG - 420
CEMM 420 Water and Wastewater Analysis Laboratory/ 1062 SELInstructor: Karl Rockne Associate Professor Office Hours: 3 cr/4 cr grad Fall 2005 Tues 3:30-5:00 Thurs 2:30-5:00 Homework Lab reports 3-5 PM Wednesdays. NOTE: I am very easily reached via e
LSU - APPL - 003
Tr ranscriptforConstr ructionInt terviewing gDay:Care eerFair V Video (Professio onalsadvicea aboutConstru uctionIntervi iewingDay) Marshall: : Useeveryb bitofthattwo ohours. Lopez: Putyoursel lfoutthere.D Dontjusthud ddleinacorn nerandnetwo orka
Michigan State University - STT - 200
For STT200 recitation 1 - 20 - 09. Be prepared to hand in the following: 1. A copy of our own hand written notes (one side of a single page) briefly describing Formulas expressing the CI for p, m, p1 - p2, m1 - m2. Fundamental claim made for CI. Link
BYU - ECE - 563
ECEn 563 Computational Electromagnetics Homework #17 Due Nov. 6, 2008 at the beginning of class Derive the Helmholtz equation from the functional I() = 1 2VdV | |2 k 2 2
Toledo - MGMT - 3030
MGT 3030: Financial Theory I 2007 Tuesday and Thursday 12:30-2:00 (room RT470) Marcel Rindisbacher Rotman School of Management 105 Saint George Street, Suite 463 office hours: Thursday 11:00 - 12:00 a.m. or by e-mail appointment. telephone: (416) 946
Michigan State University - LIB - 1923
Dec. is, 1923UNITED S T A T E S GOLF ASSOCIATION317HOLES 200 TO 235 YABDS LONG.-Ten of the 12 courses tabulated eachhave at least one hole in this class, while Apawamis and Cherry Hills each have 2. Columbia and Country Club (BrooHine) have n
Michigan State University - LIB - 1924
April i6,1924.UNITED STATES GOLF ASSOCIATION97The Green Section Loses CarrierOn April 15, 1924, Prof. Lyman Carrier severed his relations with the Green Section, to take up commercial work. By his resignation the organization has sustained a l
Michigan State University - LIB - 1925
4BULLETINOF GREEN SECTION OF THEVol.v,No.1Building a Nine-Hole Oourse for Four Thousand Dollars.By Maynard M. MetcalfIn 1897 the Oberlin Golf Club,t without formal. organization, began play on a rented pasture of 30 acres without speci
LSU - NR - 2144
Information SeriesPesticide Education Program Spray Equipment Washwater DisposalState and federal regulations on the storage and disposal of pesticide containers and spray equipment washwater are now very stringent. During the next few years, regu
Michigan State University - CEM - 883
Moller Plesset Perturbation Theory In Moller-Plesset (MP) perturbation theory one takes the unperturbed Hamiltonian for an atom or molecule as the sum of the one particle Fock operators H 0 = F (i )i =1 N where the eigenfunctions of F are the o
Michigan State University - CEM - 852
03.12.2002 Transition State Theory K=[TS]/([A]i[B]j[C]k) Rate=c[TS] = K[A]i[B]j[C]k -RTlnK = G = H - TS Observed rates: A+BYA + B +C8YhhyyryvqrrqrhuhIf rate = k[A][B] that means that there is only one path? kobs = k + k If the observed rate sh
Michigan State University - CEM - 987
Non-degenerate Perturbation Theory Frequently one wants to solve the eigenvalue problem H = E where = 0,1, 2,, and H is the sum of two terms, H = H 0 + (H H 0 ) = H 0 + V where one knows the eigenfunctions and eigenvalues of H 00
Michigan State University - CEM - 883
Chemistry 883 Fall 2008 Computational Quantum Chemistry In this course we will discuss modern theories of the electronic structure of atoms and molecules and their implementation in representative computer programs such as MOLPRO, GAUSSIAN, and GAMES
Michigan State University - CEM - 991
CEM 991: Quantum Chemistry and Statistical Thermodynamics I (Fall 2007)Lectures: MWF 9:10 a.m. - 10:00 a.m., Room 287, Chemistry Bldg. Lectures begin on Monday, August 27, 2007, and end on Friday, December 7, 2007. Instructor: Professor Piotr Piecuc
Michigan - AGENDA - 9907
10AGENDAJULY/AUGUST 1999I can put it in a nutshell for you-They had no evidence. No evidence at all.-Juror, immediately after Ryan Lang found innocent of all the citys chargesThe next hearingof those accused of damaging a rented chain-link fence
Michigan - AGENDA - 9905
GLOBAL MUSICJim Cuddy All In Time Jeff Beck Warners Music Canada 53:19 EpicAnd the 1999 Juno Award (the Canadian Grammy Awards) winner for Best Male Vocalist is Jim Cuddy for his solo work, All In Time. Cuddy and Greg Keelor are Canadas most popula
Michigan - AGENDA - 9812
18AGENDADECEMBER 1998RECORDED MUSIC REVIEWSagain, repeating verses, changing order of the words, It was fun. And her singing is very impressive, indeed! Although Ms. Simone has been recording since the late 50s, now Rhino Records has released Nina
Michigan - AGENDA - 9907
GLOBAL MUSICby William SheaJULY/AUGUST 1999AGENDA19Ned Sublette Cowboy Rumba51:51What do you get when you cross a west Texan singer song-writer, who was raised on the pop music traditions of Buddy Holly, bilingualism, and a determined cry-i
Michigan State University - READ - 1976
Michigan State University - READ - 1970
Michigan State University - READ - 1979
Michigan State University - READ - 1985
Michigan State University - READ - 1973
Michigan State University - READ - 1972
Michigan State University - READ - 1976
Michigan State University - READ - 1973
Michigan State University - READ - 1970
Michigan State University - READ - 1974
Ill. Chicago - MATH - 215
Math 215 MT 2 sample questions Q1. Suppose that T is a subset of N, such that 1 T and n N, {1, . . . , n} T {1, . . . , n = 1} T ; prove that T = N. Hint: induction. Deduce that if S N is a non-empty subset, it has a smallest element. Q2. Prove
Ill. Chicago - MTHT - 411
MthT 411 Spring 2008 First Examination March 6, 2008, 5:006:15We are not trying to find the minimum axiom set for each result. But, for each problem, state the highest number of an axiom used in your proof, directly or indirectly. Here are possible
Ill. Chicago - MATH - 512
Eliminating ExchangeJohn T. Baldwin Department of Mathematics, Statistics and Computer Science University of Illinois at Chicago September 8, 2003We are in the situation of the qm-excellence implies categoricity theorem: Let K be a quasiminimal ex