Whenever you're ready, walk me through how you'd approach this.
How would you transform a binary tree so each node becomes the sum of its inorder successor and predecessor?