摘要： public class Solution1 { int sum = 0; public int hightvalue(Node root){ if(root == null) return 0; if(root.left == null && root.right == null) return 1; int left = hightvalue(root.left); int right = hightvalue(root.right); sum = sum ... 阅读全文