[leetcode]Flatten Binary Tree to Linked List
2013-08-19 13:48
543 查看
先序遍历的一个变化。记录下上次的节点就行了。
public class Solution {
public void flatten(TreeNode root) {
Stack<TreeNode> stack = new Stack<TreeNode>();
TreeNode n = root;
TreeNode last = null;
while (n != null || !stack.empty()) {
if (n != null) {
if (last != null) {
last.left = null;
last.right = n;
}
last = n;
if (n.right != null) {
stack.push(n.right);
}
n = n.left;
}
else {
n = stack.pop();
}
}
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [leetcode] Flatten Binary Tree to Linked List
- *LeetCode-Flatten Binary Tree to Linked List
- leetcode:Flatten Binary Tree to Linked List
- leetcode：Flatten Binary Tree to Linked List 【Java】
- LeetCode题解——Flatten Binary Tree to Linked List
- Leetcode147: Flatten Binary Tree to Linked List
- LeetCode - Flatten Binary Tree to Linked List
- leetcode -- Flatten Binary Tree to Linked List
- leetcode 之 Flatten Binary Tree to Linked List 解决思路
- 【LeetCode从零单排】No 114 Flatten Binary Tree to Linked List
- [LeetCode] Flatten Binary Tree to Linked List
- 【M】【83】【leetcode题解】Flatten Binary Tree to Linked List
- LeetCode 114: Flatten Binary Tree to Linked List
- Leetcode: Flatten Binary Tree to Linked List
- 【Leetcode】Flatten Binary Tree to Linked List
- [LeetCode]Flatten Binary Tree to Linked List
- LeetCode114 Flatten Binary Tree to Linked List
- [leetcode]Flatten Binary Tree to Linked List
- LeetCode 114 Flatten Binary Tree to Linked List
- [Leetcode] Flatten Binary Tree to Linked List