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

surbhi_7 | 148 |

Rajat Thakur 2 | 140 |

Ibrahim Nash | 120 |

aksh1996aksh | 117 |

Anupam Prakash 1 | 117 |

Ibrahim Nash | 634 |

ashrepos | 534 |

RealHorror | 395 |

shi143din | 385 |

shaktiman_shaktiman_shaktiman | 363 |

akhayrutdinov | 4052 |

sanjay05 | 3423 |

Quandray | 2446 |

Michael Riegger | 2228 |

Jasleen Kaur 2 | 2012 |