-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.js
37 lines (33 loc) · 895 Bytes
/
main.js
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
/**
* Definition for a binary tree node.
* function TreeNode(val, left, right) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
*/
/**
* @param {TreeNode} root
* @return {string[]}
*/
var binaryTreePaths = function(root) {
if(!root){
return [];
}
let res = [];
if(root.left == null && root.right == null){
res.push(root.val.toString());
return res;
}
let leftPaths = binaryTreePaths(root.left);
for(let i=0;i<leftPaths.length;i++){
res.push(root.val +"->"+leftPaths[i]);
}
let rightPaths = binaryTreePaths(root.right);
for(let i=0;i<rightPaths.length;i++){
res.push(root.val+"->"+rightPaths[i]);
}
return res;
};
/// 时间复杂度: O(n), n为树中的节点个数
/// 空间复杂度: O(h), h为树的高度