Commit25840eb

authored

Create 0145-binary-tree-postorder-traversal.js

1 parent80a12e6 commit25840ebCopy full SHA for 25840eb

File tree

+26

-0

lines changed

+26

-0

lines changed

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,26 @@`
	`1`	`+/**`
	`2`	`+ * Definition for a binary tree node.`
	`3`	`+ * function TreeNode(val, left, right) {`
	`4`	`+ * this.val = (val===undefined ? 0 : val)`
	`5`	`+ * this.left = (left===undefined ? null : left)`
	`6`	`+ * this.right = (right===undefined ? null : right)`
	`7`	`+ * }`
	`8`	`+ */`
	`9`	`+/**`
	`10`	`+ * Post-order-traversal`
	`11`	`+ * Time O(n) \| Space O(n)`
	`12`	`+ * https://leetcode.com/problems/binary-tree-postorder-traversal/`
	`13`	`+ *@param {TreeNode} root`
	`14`	`+ *@return {number[]}`
	`15`	`+ */`
	`16`	`+varpostorderTraversal=function(root){`
	`17`	`+`
	`18`	`+constdfs=(node,pot)=>{`
	`19`	`+if(!node)returnpot;`
	`20`	`+dfs(node.left,pot);`
	`21`	`+dfs(node.right,pot);`
	`22`	`+pot.push(node.val);`
	`23`	`+returnpot;`
	`24`	`+}`
	`25`	`+returndfs(root,[]);`
	`26`	`+};`

Comments

(0)