LeetCode426.Convert Binary Search Tree to Sorted Doubly Linked List
题目
Convert a BST to a sorted circular doubly-linked list in-place. Think of the left and right pointers as synonymous to the previous and next pointers in a doubly-linked list.
Let's take the following BST as an example, it may help you understand the problem better:
We want to transform this BST into a circular doubly linked list. Each node in a doubly linked list has a predecessor and successor. For a circular doubly linked list, the predecessor of the first element is the last element, and the successor of the last element is the first element.
The figure below shows the circular doubly linked list for the BST above. The "head" symbol means the node it points to is the smallest element of the linked list.
Specifically, we want to do the transformation in place. After the transformation, the left pointer of the tree node should point to its predecessor, and the right pointer should point to its successor. We should return the pointer to the first element of the linked list.
The figure below shows the transformed BST. The solid line indicates the successor relationship, while the dashed line means the predecessor relationship.
Tag
代码
分治法。递归。pre引用节点。中序遍历。
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
TreeNode* Convert(TreeNode* pRootOfTree)
{
if(!pRootOfTree) return nullptr;
TreeNode* pre = nullptr;
Core(pRootOfTree,pre);
while(pRootOfTree->left)
{
pRootOfTree = pRootOfTree->left;
}
return pRootOfTree;
}
//中序遍历。递归。
void Core(TreeNode* root,TreeNode*& pre)
{
if(!root) return;//终止
//左
Core(root->left,pre);
if(pre)
{
pre->right=root;
root->left=pre;
}
//根
pre =root;
//右
Core(root->right,pre);
}
};
问题
最新文章
- Cannot attach the file ‘{0}' as database '{1}'
- MySQL的分页优化
- visio个人专注
- htnl5中设置文本单行显示,超出部分打省略号,鼠标移到文本时alt出全部文本内容
- Access界面基础操作
- 【linux】学习3
- 挂载光盘与rpm安装
- C# 获取时间差(几天前,几小时前,几分钟前,几秒前)
- hdu 1010:Tempter of the Bone(DFS + 奇偶剪枝)
- Android之判断某个服务是否正在运行的方法
- PHP与MySQL中编码的设置
- POJ 1804
- QTP检查点和参数化_百度一下
- CodeChef A
- Maven使用本地jar包(两种方式)
- Node.js实战项目学习系列(1) 初识Node.js
- mysql导出CSV格式的文件
- 【381】python 获取列表中重复元素的索引值
- soj1036. Crypto Columns
- 快速求出n!的质因数的个数
热门文章
- LeetCode 454.四数相加 II(C++)
- pat1019. General Palindromic Number (20)
- IA-32e架构下的内核初始化内存管理
- Homemade Script Language: RED
- GitKraken使用教程-基础部分(6)
- 初步学习XML的基本代码
- Docker 清理命令汇总
- [RabbitMQ]Windows环境下rabbitmqclt(Command Line Tools)出现Erlang distribution failed错误的解决方法
- <;Android 基础(十七)>; ViewPager介绍
- npm升级自身