二叉树的先序，怎样将树的中序遍历的数输入到一个数组中_LeetCode 530.二叉搜索树的最小绝对差

输入：13/2输出：
1

void InOrder(tree root){if (root == NULL) return ;InOrder(root->left);visit(root->val);InOrder(root->right);
}

class Solution {
public:int flag = 0;int cur;int pre;void InOrder(TreeNode* root,int &temp, int &min){if (root == NULL) return ;InOrder(root->left, temp, min);if (flag == 0){flag = 1;pre = root->val;}else  {cur = root->val;temp = abs(pre - cur);if (temp < min){min = temp;}pre = cur;}InOrder(root->right, temp, min);}int getMinimumDifference(TreeNode* root) {if (root == NULL) return 0;int temp;if (root->left == NULL){temp = abs(root->val - root->right->val);}else{temp = abs(root->val - root->left->val);}int min = temp;InOrder(root, temp, min);return min;}
};