Given a binary tree root node, return the sum of all the nodes of the tree.The total sum is calculated by recursively adding the value of the current node, the sum of the left subtree, and the sum of the right subtree.If the root node is null, the sum is 0.The sum of all the nodes in the binary tree is returned.