Exam 2

  • Review algorithms for creating BSTTree and other topics (such as mid -1, mid+1)
  • I haven’t actually implemented Toposort, so I want to solve some problems related to it
  • Quick answers
  • Also, advanced sorting algorithms like counting sort and bucket sort?

  • Topics to cover

    • Trees and related concepts
  • Things to keep in mind

    • Be careful with Θ/O notation, as there can be traps and complexities to consider
    • Think about edge cases
    • Note that rounding is done by rounding down
  • Check how to reverse a linked list

  • Review and summarize the base law for easy reference during the exam

    • log has a base of 10
    • lg has a base of 2
  • Consider the complexities of problems like hanoi and tree traversal

  • Is there an n_0=0 case?