int i=0; int temp; int min=0; public int minDifference (TreeNode root) { // write code here minDifferenceOne(root); return min; } //中序遍历是递增有...