Count all k-sum paths in a Binary Tree
Given a binary tree and an integer k. The task is to count the number of paths in the tree with the sum of the nodes equals to k.
A path can start from any node and end at any node and must be downward only, i.e. they need not be root node and leaf node, and negative numbers can also be there in the tree.
Input : k = 5 Root of below binary tree: 1 / \ 3 -1 / \ / \ 2 1 4 5 / / \ \ 1 1 2 6 Output : No of paths with sum equals to 5 are: 8 3 2 3 1 1 1 3 1 4 1 1 -1 4 1 -1 4 2 5 1 -1 5 Input : k = 3 1 / \ 2 -1 / \ / 1 2 3 / \ 2 5 Output : No of paths with sum equals to 3 are : 4
The implementation of printing paths with path sum equal to k is already discussed in this post using vector. However, storing in vector and recursively moving increases both space and time complexity if we just want to store the count of such paths
An efficient implementation of the above problem can be done in using backtracking and unordered maps.
- We will be using a unordered map which will be filled with various path sum.
- For every node we will check if current sum and root’s value equal to k or not. If the sum equals to k then increment the required answer by one.
- Then we will add all those path sum in map which differs from current sum+root->data value by a constant integer k.
- Then we will be inserting the current sum + root->data value in the map.
- We will recursively check for left and right subtrees of current root
- After the right subtree is also traversed we will remove the current sum + root->data value from the map so that it is not taken into consideration in further traversals of other nodes other than the current root’s
Below is the implementation of the above approach:
No of paths with sum equals to 3 are : 4
Time Complexity: O(N), where N is the number of nodes in the tree
Space Complexity: O(N), where N is the number of nodes in the tree