[LeetCode] Path Sum Debuging

public static void main(String[] args) { //[5,4,8,11,null,13,4,7,2,null,null,null,1]; Solution s = new Solution(); TreeNode root = new TreeNode(5); root.left = new TreeNode(4); root.right = new TreeNode(8); root.left.left = new TreeNode(11); root.left.right = new TreeNode((Integer)null); root.right.left = new TreeNode(13); root.right.right = new TreeNode(4); root.left.left.left = new TreeNode(7)..