|All-time Popular Problems|
|Inorder Successor in BST|
|Depth First Traversal for a Graph|
|Delete nodes having greater value on right|
|Column name from a given column number|
|Search an Element in an array|
|Diameter of Binary Tree|
|Get minimum element from stack|
|Subset Sum Problem|
|Reverse words in a given string|
|Reverse a linked list|
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.
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.
Return the Count of number of paths in tree.
1 3 L 3 2 L 3 -1 R -1 1 R