05-18 19:36 已编辑 安徽师范大学附属外国语学校 C++ 发布于安徽
关注
二叉搜索树与双向链表，C语言模仿实现
static struct TreeNode* head = NULL;
static struct TreeNode* pre = NULL;
struct TreeNode* Convert(struct TreeNode* pRootOfTree ) {
// write code here
if (pRootOfTree == NULL)
return NULL;
Convert(pRootOfTree->left);
if (pre == NULL) {
pre = pRootOfTree;
head = pRootOfTree;
}
else {
pre->right = pRootOfTree;
pRootOfTree->left = pre;
pre = pRootOfTree;
}
Convert(pRootOfTree->right);
return head;
}#牛客AI配图神器#
static struct TreeNode* pre = NULL;
struct TreeNode* Convert(struct TreeNode* pRootOfTree ) {
// write code here
if (pRootOfTree == NULL)
return NULL;
Convert(pRootOfTree->left);
if (pre == NULL) {
pre = pRootOfTree;
head = pRootOfTree;
}
else {
pre->right = pRootOfTree;
pRootOfTree->left = pre;
pre = pRootOfTree;
}
Convert(pRootOfTree->right);
return head;
}#牛客AI配图神器#
全部评论
相关推荐
05-05 15:27
齐鲁工业大学 C++ 点赞 评论 收藏
分享
05-19 03:40
门头沟学院 Java 点赞 评论 收藏
分享
