typical introductory data structures course covers the first seven of this text introduces python programming and the tkinter module which is used in various places in the text tkinter comes with pythonso no special libraries need be installed for students to use it tkinter is used to visualize many of the results in this text introduces complexity analysis and depending on your needssome of the material in chap could be skipped in an introductory data structures course in particularthe material on th notation and amortized complexity can be skipped big-oh notation is enough for the first seven typicallychap is covered lightly and near the end of semester course it seems there is generally not enough time in semester to cover graph theory in much detail advanced courses in data structures and algorithms should start with chap if students are unfamiliar with python or tkinter brief refresher may not be bad even for those that have programmed using python before should be covered in detail including the material on th notation and amortized complexity some review of hashing as it is used in sets and maps in chap may be good review earlier in the advanced course along with brief discussion of binary search trees and tree traversals in chap depending on your needschap would be good to cover next including the material on depth first search of graph is where the advanced material begins with assumptions made that students understand the concepts presented in the earlier the two introductory along with chaps - make seven-sequence that will fill semeseter in an advanced course nicely this text is very project oriented solutions for all projects are available from kent lee you can contact kent at kentdlee@luther edu for instructor solutions you must provide proof (through website or other referencethat you are an instructor at an educational institution to get access to the instructor materials vii this copy belongs to 'acha