# diagonal sum in Binary Tree Problem Solution -

In this blog we will see How to print Diagonal Sum In Binary Tree| diagonal sum in Binary Tree Problem Solution . It is most common question related to recursion lets read diagonal sum in Binary Tree Problem.

## Problem Statement-

Consider Red lines of slope -1 passing between nodes (in following diagram). The diagonal sum in a binary tree is the sum of all node’s data lying between these lines. Given a Binary Tree of size N, print all diagonal sums.

For the following input tree, output should be 9, 19, 42.
9 is sum of 1, 3 and 5.
19 is sum of 2, 6, 4 and 7.
42 is sum of 9, 10, 11 and 12.

Example 1:

```Input:
4
/   \
1     3
/
3
Output: 7 4
```

Example 2:

```Input:
10
/    \
8      2
/ \    /
3   5  2
Output: 12 15 3
```

You don't need to take input. Just complete the function diagonalSum() that takes root node of the tree as parameter and returns an array containing the diagonal sums for every diagonal present in the tree with slope -1.

Expected Time Complexity: O(N).
Expected Auxiliary Space: O(N).

Constraints:
1<=Number of nodes<=105

Note: The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

Problem Credit - GeeksForGeeks (This Problem is taken From geeks for geeks website).

## Recommended: Please try your approach before moving on to the solution.

After a deep observation, I divided this binary tree having n diagonal and I will write a function that will calculate all diagonal sum and store solution in a map.
for example, diagonal number 1 ans will be stored in a map having key 1.
see the image below

### Fucntion Descreption ->

I have written a function that returns the sum of diagonal if I pass the current root, map(for storing diagonal sum till now ), and diagonal number to this function parameter. This is a magical function, isn't it ðŸ˜†ðŸ˜†  XD.

Now I have to find the smallest possible case which will help me to write base case of my problem
if the root doesn't exist I have to simply return because the tree is empty.
Now I found the smallest problem  Lets write base case.

if(!root){
return ;
}

Now How to write the next block of code.

#### Think like that -

I don't know the solution but if somehow i get diagonal sum excluded root node my task  will be minimized and i will  add only root node to previous sum.

`At the same time, I noticed that whenever I go to the left of my root node every time my diagonal number increased by 1. By Using this Property I can write my diagonal sum in Binary Tree Problem Solution.
so Let's write the induction step now if you think like that it will very easy to write induction step-

calculateDiagonalSum(diagonalNumber+1,root->left,mymap);
calculateDiagonalSum(diagonalNumber,root->right,mymap);
mymap[diagonalNumber]+=root->data;
return ;

Hopefully, You understood the entire solution if not comment below.
Here is the complete code of my solution -

### codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster

Codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster- Codeforces is one of the most popular platforms for competitive programmers and  codeforces rating matters a lot  .  Competitive Programming  teaches you to find the easiest solution in the quickest possible way. CP enhances your problem-solving and debugging skills giving you real-time fun. It's brain-sport. As you start solving harder and harder problems in live-contests your analytical and rational thinking intensifies. To have a good codeforces profile makes a good impression on the interviewer. If you have a good  codeforces profile so it is very easy to get a referral for product base company like amazon, google , facebook etc.So in this blog I have explained everything about codeforces rating system. What are different titles on codeforces- based on rating codeforces divide rating into 10 part. Newbie Pupil Specialist Expert Candidate Codemaster Master International Master Grandmaster Internat

### Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code - Apple Division CSES Problem Solution Easy Explanation. Apple division is problem is taken form cses introductory problem set.Let's Read Problem statement first. Problem Statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  apples with known weights. Your task is to divide the apples into two groups so that the difference between the weights of the groups is minimal. Input The first input line has an integer  n n : the number of apples. The next line has  n n  integers  p 1 , p 2 , … , p n p 1 , p 2 , … , p n : the weight of each apple. Output Print one integer: the minimum difference between the weights of the groups. Constraints 1 ≤ n ≤ 20 1 ≤ n ≤ 20 1 ≤ p i ≤ 10 9 1 ≤ p i ≤ 10 9 Example Input: 5 3 2 7 4 1 Output: 1 Explanation: Group 1 has weights 2, 3 and 4 (total weight 9), and group 2 has weights 1 and 7 (total weight 8). Join Telegram channel for code discussi

### Movie Festival CSES problem set solution

Movie Festival CSES problem set solution - Problem statement-  Time limit:  1.00 s   Memory limit:  512 MB In a movie festival  n n  movies will be shown. You know the starting and ending time of each movie. What is the maximum number of movies you can watch entirely? Input The first input line has an integer  n n : the number of movies. After this, there are  n n  lines that describe the movies. Each line has two integers  a a  and  b b : the starting and ending times of a movie. Output Print one integer: the maximum number of movies. Constraints 1 ≤ n ≤ 2 ⋅ 10 5 1 ≤ n ≤ 2 ⋅ 10 5 1 ≤ a < b ≤ 10 9 1 ≤ a < b ≤ 10 9 Example Input: 3 3 5 4 9 5 8 Output: 2 Solution - Step -1 take input in a vector as a pair first element is ending time ans second element is starting time Step -2 sort the vector in increasing order because we will watch that movie which is ending first. Step -3 iterate over vector and calculate ans .           follow code below-