LeetCode 897. 递增顺序搜索树
原题链接
简单
作者:
飞呀
,
2021-05-06 14:39:29
,
所有人可见
,
阅读 258
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* p = new TreeNode();
TreeNode* cur = p;
void inOrder(TreeNode* root){
if(root == nullptr){
return;
}
inOrder(root->left);
TreeNode* tmp = new TreeNode(root->val);
cur->right = tmp;
cur = cur->right;
inOrder(root->right);
}
TreeNode* increasingBST(TreeNode* root) {
inOrder(root);
return p->right;
}
};