-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathbinary-tree-level-order-traversal-ii.js
More file actions
85 lines (83 loc) · 1.48 KB
/
binary-tree-level-order-traversal-ii.js
File metadata and controls
85 lines (83 loc) · 1.48 KB
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
/**
* Source: https://leetcode.com/problems/binary-tree-level-order-traversal-ii/
* Tags: [Tree,Breadth-first Search]
* Level: Easy
* Title: Binary Tree Level Order Traversal II
* Auther: @imcoddy
* Content: Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).
*
*
* For example:
* Given binary tree {3,9,20,#,#,15,7},
*
* 3
* / \
* 9 20
* / \
* 15 7
*
*
*
* return its bottom-up level order traversal as:
*
* [
* [15,7],
* [9,20],
* [3]
* ]
*
*
*
* confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.
*
* OJ's Binary Tree Serialization:
*
* The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.
*
*
* Here's an example:
*
* 1
* / \
* 2 3
* /
* 4
* \
* 5
*
* The above binary tree is serialized as "{1,2,3,#,#,4,#,#,5}".
*
*
*
*
* Subscribe to see which companies asked this question
*
*
*
*
*
*
*
*
*
*
*
*
* Show Similar Problems
*
*
* (E) Binary Tree Level Order Traversal
*/
/**
* Definition for a binary tree node.
* function TreeNode(val) {
* this.val = val;
* this.left = this.right = null;
* }
*/
/**
* @param {TreeNode} root
* @return {number[][]}
*/
var levelOrderBottom = function(root) {
};