Given a a Binary Tree, your task is to complete the function **getLevelDiff **which returns the difference between the sum of nodes at odd level and the sum of nodes at even level . The function **getLevelDiff** takes only one argument ie the root of the binary tree .

2

/ \

3 5

For the above tree the odd level sum is 2 and even level sum is 8 thus the difference is 2-8=-6

**Input:**

The task is to complete the method which takes one argument, root of Binary Tree. There are multiple test cases. For each test case, this method will be called individually.

**Output:**

The function should return an integer denoting the difference between the sum of nodes at odd level and the sum of nodes at even level

**Constraints:**

1 <=T<= 30

1 <= Number of nodes<= 20

**Example:
Input**

2

2

1 2 R 1 3 L

4

10 20 L 10 30 R 20 40 L 20 60 R

**Output**

-4

60

There are two test cases. First case represents a tree with 3 nodes and 2 edges where root is 1, left child of 1 is 3 and right child of 1 is 2. Second test case represents a tree with 4 edges and 5 nodes.

**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.

Ibrahim Nash | 98 |

Stark_Maverick | 77 |

Eduardo Feo | 66 |

Micky_Kt | 62 |

Rohit Sharma 16 | 61 |

Lam Ngoc Pham | 463 |

All Is Well | 399 |

Divvya Sinha | 374 |

Prateek Gole | 369 |

Ibrahim Nash | 338 |

akhayrutdinov | 3855 |

sanjay05 | 3366 |

Michael Riegger | 2030 |

Jasleen Kaur 2 | 2012 |

Quandray | 1969 |