You are given a binary tree. Each node of the tree is attached with value denoted by array nums. The ith node in binary tree has nums[i] value attached to it.
You need to output the node and sum that has maximum subtree sum.
Your notes are automatically saved in your browser's local storage and will persist across sessions on this device.