**Compilation/Execution Result:**

A binary tree and a number k are given. Print the count of every path in the tree with sum of the nodes in the path as k.

**Input:**

First line consists of T test cases. First line of every test case consists of N, denoting the number of Node is Binary tree. Second line consists of N spaced 3 elements denoting the Parent node, Child Node and a character denoting left or right child. Third line of every test case consists of a integer K.

**Output:**

Return the Count of number of paths in tree.

**Constraints:**

1<=T<=20

1<=N<=100

**Example:
Input:**

1

4

1 3 L 3 2 L 3 -1 R -1 1 R

4

2

Author: saksham seth

Shashank_Pathak | 200 |

surbhi_7 | 168 |

yati493 | 167 |

SANJAY5797 | 164 |

dark_knights | 162 |

surbhi_7 | 556 |

Shashank_Pathak | 556 |

dark_knights | 501 |

Infinty | 341 |

Vasudha Gupta | 308 |

akhayrutdinov | 4156 |

sanjay05 | 3597 |

Quandray | 2778 |

Ibrahim Nash | 2475 |

Michael Riegger | 2280 |