题目:
给你一棵二叉搜索树的 root ,请你 按中序遍历 将其重新排列为一棵递增顺序搜索树,使树中最左边的节点成为树的根节点,并且每个节点没有左子节点,只有一个右子节点。
示例:
输入:root = [5,3,6,2,4,null,8,1,null,null,null,7,9] 输出:[1,null,2,null,3,null,4,null,5,null,6,null,7,null,8,null,9]
代码:(二叉树的中序遍历)
/**
* 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:
void inorder(TreeNode* node, TreeNode*& resNode) {
if (node == nullptr) {
return;
}
inorder(node->left, resNode);
// 在中序遍历过程中修改节点的指向
resNode->right = node;
node->left = nullptr;
resNode = node;
inorder(node->right, resNode);
}
TreeNode* increasingBST(TreeNode* root) {
// 辅助节点
TreeNode* dummyNode = new TreeNode(-1);
auto resNode = dummyNode;
inorder(root, resNode);
auto resultNode = dummyNode->right;
delete dummyNode;
return resultNode;
}
};