blob: cfe97ecf67268d89d616c121e898b96d9d76df5f (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
|
#include "leetcode.h"
class Solution {
public:
TreeNode *increasingBST(TreeNode *root) {
TreeNode *temp;
TreeNode *ans = new TreeNode();
temp = ans;
inOrder(ans, root);
return temp->right;
}
private:
void inOrder(TreeNode *&ans, TreeNode *root) {
if (!root)
return;
inOrder(ans, root->left);
ans->right = new TreeNode(root->val);
ans = ans->right;
inOrder(ans, root->right);
}
};
int main() {}
|