Commita2235ae

authored

Merge pull requestneetcode-gh#3292 from shivammm21/main

Create 0144-binary-tree-preorder-traversal.java

2 parents1ae934b +8dc8ba6 commita2235aeCopy full SHA for a2235ae

File tree

+39

-0

lines changed

+39

-0

lines changed

Lines changed: 39 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,39 @@`
	`1`	`+/**`
	`2`	`+ * Definition for a binary tree node.`
	`3`	`+ * public class TreeNode {`
	`4`	`+ * int val;`
	`5`	`+ * TreeNode left;`
	`6`	`+ * TreeNode right;`
	`7`	`+ * TreeNode() {}`
	`8`	`+ * TreeNode(int val) { this.val = val; }`
	`9`	`+ * TreeNode(int val, TreeNode left, TreeNode right) {`
	`10`	`+ * this.val = val;`
	`11`	`+ * this.left = left;`
	`12`	`+ * this.right = right;`
	`13`	`+ * }`
	`14`	`+ * }`
	`15`	`+ */`
	`16`	`+classSolution {`
	`17`	`+`
	`18`	`+staticvoidpreOrder(TreeNoderoot,List<Integer>res){`
	`19`	`+`
	`20`	`+`
	`21`	`+if(root ==null){`
	`22`	`+return;`
	`23`	`+ }`
	`24`	`+res.add(root.val);`
	`25`	`+preOrder(root.left,res);`
	`26`	`+preOrder(root.right,res);`
	`27`	`+`
	`28`	`+ }`
	`29`	`+`
	`30`	`+publicList<Integer>preorderTraversal(TreeNoderoot) {`
	`31`	`+`
	`32`	`+List<Integer>res =newArrayList<>();`
	`33`	`+`
	`34`	`+preOrder(root,res);`
	`35`	`+`
	`36`	`+returnres;`
	`37`	`+`
	`38`	`+ }`
	`39`	`+}`

Comments

(0)