题解 | #二叉搜索树与双向链表#
二叉搜索树与双向链表
https://www.nowcoder.com/practice/947f6eb80d944a84850b0538bf0ec3a5
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
void InOrderConvert(TreeNode*cur,TreeNode *&prev)
{
if(cur==nullptr)
return;
InOrderConvert(cur->left,prev);
cur->left=prev;
if(prev)
{
prev->right=cur;
}
prev=cur;
InOrderConvert(cur->right,prev);
}
TreeNode* Convert(TreeNode* pRootOfTree) {
TreeNode *prev=nullptr;
InOrderConvert(pRootOfTree, prev);
TreeNode*head=pRootOfTree;
while(head&&head->left)
head=head->left;
return head;
}
};
投递华为等公司10个岗位 >