想到了中序遍历,但是还是不会用啊
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
TreeNode* preNode;
TreeNode* Convert(TreeNode* pRootOfTree) {
if (!pRootOfTree)
return pRootOfTree;
TreeNode* p = pRootOfTree;
while(p->left) {
p = p->left;
}
preNode = nullptr;
inOrder(pRootOfTree);
return p;
}
void inOrder(TreeNode* root) {
if (!root)
return;
inOrder(root->left);
root->left = preNode;
if (preNode){
preNode->right = root;
}
preNode = root;
inOrder(root->right);
}
};