Your question is Binary Tree Inorder Successor/Predecessor Sum. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
How would you transform a binary tree so each node becomes the sum of its inorder successor and predecessor?