Problem:
Given a binary tree, flatten it to a linked list in-place.
For example,
Given
1 / \ 2 5 / \ \ 3 4 6
1 \ 2 \ 3 \ 4 \ 5 \ 6
Hints:
If you notice carefully in the flattened tree, each node's right child points to the next node of a pre-order traversal.
意思很明了,就是二叉树中序遍历,为了使逻辑更清晰,创建了一个外节点。
Solution:
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public void flatten(TreeNode root) {
Stack<TreeNode> st = new Stack<>();
st.push(root);
TreeNode tail = new TreeNode(-1);
while(!st.empty())
{
TreeNode p = st.pop();
while(p!=null)
{
tail.left = null;
tail.right = p;
tail = tail.right;
if(p.right!=null)
st.push(p.right);
p = p.left;
}
}
}
}
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public void flatten(TreeNode root) {
Stack<TreeNode> st = new Stack<>();
st.push(root);
TreeNode tail = new TreeNode(-1);
while(!st.empty())
{
TreeNode p = st.pop();
while(p!=null)
{
tail.left = null;
tail.right = p;
tail = tail.right;
if(p.right!=null)
st.push(p.right);
p = p.left;
}
}
}
}