#Binary Trees

Calculate the sum of cousin nodes in a binary tree. The approach involves two traversals: the first to calculate the sum of values at each level and the second to compute the sibling sums. The new node value is the level sum minus the sibling sum.

Explain how you would implement a function to return the maximum element in a binary tree. What is the time complexity?

Count the total number of nodes in a binary tree. Use inorder traversal as your approach.