leetcode -- 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:

AC代码

leetcode上面一位大神的解法

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    private TreeNode prev = null;

public void flatten(TreeNode root) {
    if (root == null)
        return;
    flatten(root.right);
    flatten(root.left);
    root.right = prev;
    root.left = null;
    prev = root;
}
}