Difference between revisions of "TADM2E 3.11"

Revision as of 18:13, 11 September 2014

1. Use an nxn matrix populated with the distance between the nodes at the two indices.
2. Solution two choice 2:
   • http://en.wikipedia.org/wiki/Cartesian_tree[1]
   • http://en.wikipedia.org/wiki/Treap[2]