题目来源:https://leetcode.com/problems/flatten-binary-tree-to-linked-list/
问题描述
114. Flatten Binary Tree to Linked List
Medium
Given a binary tree, flatten it to a linked list in-place.
For example, given the following tree:
1
/ \
2 5
/ \ \
3 4 6
The flattened tree should look like:
1
\
2
\
3
\
4
\
5
\
6
------------------------------------------------------------
题意
给定一个二叉搜索树(按中序遍历从小到大),将二叉树变形成有序链表,其中树节点的右指针作为链表的next指针,树节点的左指针指空。要求原地操作,即空间复杂度为O(1).
------------------------------------------------------------
思路
就是考查二叉树的先序遍历(先遍历根节点,再遍历左子树,最后遍历右子树)。只不过遍历的过程中要考虑指针的重定向。
用递归实现,递归函数的输入参数是子树的根节点,返回值是子树中的最右节点。
特别注意节点只有左子树而右子树为空或节点只有右子树而左子树为空的情况。
------------------------------------------------------------
代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
private TreeNode preorder(TreeNode root)
{
if (root == null)
{
return null;
}
TreeNode tmp = root.right, left_tail = preorder(root.left);
if (root.left != null)
{
root.right = root.left;
}
root.left = null;
if (left_tail != null)
{
left_tail.left = null;
left_tail.right = tmp;
}
TreeNode right_tail = preorder(tmp);
return right_tail == null ? (left_tail == null ? root: left_tail): right_tail;
}
public void flatten(TreeNode root) {
preorder(root);
}
}