Wednesday, April 26, 2017

Episode 18 - Tree Traversal Trickery

Try these problems:

Last week, I mentioned I would be running this episode on Wednesday due to travelling to the TCO regional event in Austin. It turns out there is an SRM at this time! So this week's episode will take place a day later.

In this episode, I will cover a handful of tricks involving preorder and postorder numbers on trees and some neat properties involving them. I'll also discuss two different approaches for solving the problems linked above.

See you live! (stream, time)

4 comments:

  1. here is judge for family fortune: https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=541&problem=3788

    ReplyDelete
  2. Hi, Matt! Where do you get inputs for ICPC? And do you know is there an alternative judge or inputs for 'knapsack' (It does not accepts java and c++ compiler seems very old)?

    ReplyDelete
    Replies
    1. (I meant "test cases" ofc)

      Delete
    2. http://main.edu.pl/en/user.phtml?op=zasoby

      Delete