题目描述
二叉搜索树与双向链表一个超简单好理解符合题意的模板
C++ 代码
class Solution {
public:
TreeNode* convert(TreeNode* root) {
if (!root) return NULL;
auto cur = root;
if (root->left)
{
auto l = convert(root->left);
cur = l;
while (l->right) l = l->right;
root->left = l, l->right = root;
}
if (root->right)
{
auto r = convert(root->right);
root->right = r, r->left = root;
}
return cur;
}
};