Commitd2a20ad

authored

Merge pull requestneetcode-gh#2595 from fahim041/0144-binary-tree-preorder-traversal.ts

create: 0144-binary-tree-preorder-traversal.ts

2 parents1f5f85a +91ac80d commitd2a20adCopy full SHA for d2a20ad

File tree

+30

-0

lines changed

+30

-0

lines changed

Lines changed: 30 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,30 @@`
	`1`	`+/**`
	`2`	`+ * Definition for a binary tree node.`
	`3`	`+ * class TreeNode {`
	`4`	`+ * val: number`
	`5`	`+ * left: TreeNode \| null`
	`6`	`+ * right: TreeNode \| null`
	`7`	`+ * constructor(val?: number, left?: TreeNode \| null, right?: TreeNode \| null) {`
	`8`	`+ * this.val = (val===undefined ? 0 : val)`
	`9`	`+ * this.left = (left===undefined ? null : left)`
	`10`	`+ * this.right = (right===undefined ? null : right)`
	`11`	`+ * }`
	`12`	`+ * }`
	`13`	`+ */`
	`14`	`+`
	`15`	`+functionpreorderTraversal(root:TreeNode\|null):number[]{`
	`16`	`+letres:number[]=[];`
	`17`	`+`
	`18`	`+functiondfs(root){`
	`19`	`+if(!root){`
	`20`	`+return;`
	`21`	`+}`
	`22`	`+`
	`23`	`+res.push(root.val);`
	`24`	`+dfs(root.left);`
	`25`	`+dfs(root.right);`
	`26`	`+}`
	`27`	`+`
	`28`	`+dfs(root);`
	`29`	`+returnres;`
	`30`	`+}`

Comments

(0)