[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);
		root.left.left.right = new TreeNode(2);
		root.right.left.left = new TreeNode((Integer)null);
		root.right.left.right = new TreeNode((Integer)null);
		root.right.right.left = new TreeNode((Integer)null);
		root.right.right.right = new TreeNode(1);
		
		System.out.println(s.hasPathSum(root, 22));
		
	}
    
root Main$TreeNode  (id=59) -> targetSum 22
root Main$TreeNode  (id=60) -> targetSum 17
root Main$TreeNode  (id=61) -> targetSum 13
root Main$TreeNode  (id=62) -> targetSum 2
root Main$TreeNode  (null) -> targetSum -5
root Main$TreeNode  (id=62) -> targetSum -5
root Main$TreeNode  (id=62) -> targetSum 2
root Main$TreeNode  (id=61) -> targetSum 13
root Main$TreeNode  (id=63) -> targetSum 2

True발견

root Main$TreeNode  (id=61) -> targetSum 13
root Main$TreeNode  (id=60) -> targetSum 17
root Main$TreeNode  (id=59) -> targetSum 22
return Main$TreeNode  (id=58);

5 -> 4 -> 8 -> 11 -> 7 -> left -> right -> 7 -> 11 -> 2 -> 
true -> return -> return -> return -> return(System.out.println)