We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent ca2988b commit e144953Copy full SHA for e144953
107-binary-tree-level-order-traversal-ii.js
@@ -0,0 +1,25 @@
1
+/**
2
+ * Definition for a binary tree node.
3
+ * function TreeNode(val) {
4
+ * this.val = val;
5
+ * this.left = this.right = null;
6
+ * }
7
+ */
8
9
+ * @param {TreeNode} root
10
+ * @return {number[][]}
11
12
+const levelOrderBottom = function(root) {
13
+ const levels = []
14
+ postOrderTraversal(root)
15
+ return levels.reverse()
16
+
17
+ function postOrderTraversal(node, level = 0) {
18
+ if (node) {
19
+ if (!levels[level]) levels.push([])
20
+ postOrderTraversal(node.left, level + 1)
21
+ postOrderTraversal(node.right, level + 1)
22
+ levels[level].push(node.val)
23
+ }
24
25
+}
0 commit comments