Key points for this one:
- Relate the comparison process to BST search
- Reasoning on extreme values: "We can notice that for a fixed the maximum sum of depths is achieved when every node has just a left child and the minimum sum of depths os achieved when the binary tree is an almost complete binary tree."
- We iteratively construct resulting tree from the degenerated BST
Note: this one is very interesting, deserving several revisit.
