By

文章目录

Problem:
Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.

Given a binary tree, flatten it to a linked list in-place.

For example,
Given

    1
   / \
  2   5
 / \   \
3   4   6

The flattened tree should look like:

1
\
 2
  \
   3
    \
     4
      \
       5
        \
         6

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
/**
 * 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) {
        if(root==null)
			return ;
			
		flatten(root.left);
		
		flatten(root.right);
		
		if(root.left!=null)
		{
			//move the left leaf to the right
			TreeNode tempNode=root.left;
			while(tempNode.right!=null)
			{
				tempNode=tempNode.right;
			}
			
			
			tempNode.right=root.right;
	        root.right=root.left;
	        root.left=null;
		}
    }
}

本作品采用[知识共享署名-非商业性使用-相同方式共享 2.5]中国大陆许可协议进行许可，我的博客欢迎复制共享，但在同时，希望保留我的署名权kubiCode，并且，不得用于商业用途。如您有任何疑问或者授权方面的协商，请给我留言。

文章目录