FilesExpand file tree

 master

/

MergeTwoBinaryTrees.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

44 lines (36 loc) · 1020 Bytes

 master

/

MergeTwoBinaryTrees.java

Copy path

Top

File metadata and controls

• Code
• Blame

44 lines (36 loc) · 1020 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

35

36

37

38

39

40

41

42

43

44

package leetcode;

public class MergeTwoBinaryTrees {

public static void main(String[] args) {

TreeNode t1 = new TreeNode(1);

t1.left = new TreeNode(3);

t1.right = new TreeNode(2);

t1.left.left= new TreeNode(5);

TreeNode t2 = new TreeNode(2);

t2.left = new TreeNode(1);

t2.right = new TreeNode(3);

t2.left.right = new TreeNode(4);

MergeTwoBinaryTrees test = new MergeTwoBinaryTrees();

TreeNode t = test.mergeTrees(t1, t2);

System.out.println(t.val);

System.out.println(t.left.val);

System.out.println(t.right.val);

System.out.println(t.left.right.val);

}

public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {

if(t1==null && t2==null) return null;

if(t1==null) return t2;

if(t2==null) return t1;

TreeNode t= new TreeNode(t1.val+t2.val);

t.left = mergeTrees(t1.left, t2.left);

t.right = mergeTrees(t1.right, t2.right);

return t;

}

}

//class TreeNode{

// int val ;

// TreeNode left;

// TreeNode right;

// TreeNode(int x){

// val= x;

// }

//}