Given a binary tree and a value k. A path is called heavy path if the sum of the elements in the path (path from root to leaf) > k remove all the paths from the tree which are not heavy
Answers
Answered by
0
Explanation:
Sorry I didnt understand thr question
Please type it properly.
Similar questions