https://leetcode.com/problems/flatten-binary-tree-to-linked-list/
解题思路:
遍历一遍树,如果根节点的右子节点不为空,将其入栈,并将左子节点移到右边,左边制空。当移到叶子节点时,再将栈里的节点依次弹出。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public void flatten(TreeNode root) {
if (root == null)