leetcode 671 Second Minimum Node In a Binary Tree
Javaclass Solution { public int findSecondMinimumValue(TreeNode root) { if(root==null) return -1; if(root.left==null && root.right==null) return -1; int left=roo
