## Path Sum II (LeetCode Java Solution)

Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.

Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.

Width of a Binary Tree is defined as maximum number of nodes present at any level in the binary tree.