# Maximum difference between a node and its descendant

Posted: 12 Jul, 2020

Difficulty: Moderate

#### Given a binary tree, find the maximum difference between the values of two nodes 'A' and 'B' where 'A' is an ancestor of 'B'.

##### Note :

```
A node that is connected to all lower-level nodes is called an "ancestor". The connected lower-level nodes are descendants of the ancestor node.
```

##### Input format :

```
Elements in the level order form. The input consists of values of nodes separated by a single space in a single line. In case a node is null, we take -1 on its place.
For example, the input for the tree depicted in the below image would be :
```

```
1
2 3
4 -1 5 6
-1 7 -1 -1 -1 -1
-1 -1
```

#### Explanation :

```
Level 1 :
The root node of the tree is 1
Level 2 :
Left child of 1 = 2
Right child of 1 = 3
Level 3 :
Left child of 2 = 4
Right child of 2 = null (-1)
Left child of 3 = 5
Right child of 3 = 6
Level 4 :
Left child of 4 = null (-1)
Right child of 4 = 7
Left child of 5 = null (-1)
Right child of 5 = null (-1)
Left child of 6 = null (-1)
Right child of 6 = null (-1)
Level 5 :
Left child of 7 = null (-1)
Right child of 7 = null (-1)
The first not-null node (of the previous level) is treated as the parent of the first two nodes of the current level. The second not-null node (of the previous level) is treated as the parent node for the next two nodes of the current level and so on.
The input ends when all nodes at the last level are null (-1).
```

##### Note :

```
The above format was just to provide clarity on how the input is formed for a given tree.
The sequence will be put together in a single line separated by a single space. Hence, for the above depicted tree, the input will be given as:
1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1
```

##### Output Format :

```
The maximum difference of the nodes.
```

##### Note

```
You are not required to print anything, and it has already been taken care of. Just implement the function.
```

##### Constraints :

```
0 <= Number of nodes <= 10^7
0 <= Value of node <= 10^8
Timi Limit: 1sec
```

SIMILAR PROBLEMS

Can You Print

Posted: 14 Apr, 2022

Difficulty: Easy

Prime Digit Sum

Posted: 17 Apr, 2022

Difficulty: Hard

Prime Digit Sum

Posted: 17 Apr, 2022

Difficulty: Hard

Height of Binary Tree

Posted: 22 Apr, 2022

Difficulty: Easy

Mario And His Princess

Posted: 12 May, 2022

Difficulty: Moderate

Locked Binary Tree

Posted: 12 May, 2022

Difficulty: Easy