Skip to content

Commit bc3a0b4

Browse files
author
easyone
committed
Fix: Fix line break.
1 parent 9264bff commit bc3a0b4

File tree

1 file changed

+0
-10
lines changed

1 file changed

+0
-10
lines changed

construct-binary-tree-from-preorder-and-inorder-traversal/easyone-jwlee.go

Lines changed: 0 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -10,15 +10,6 @@
1010
// SC
1111
// map O(n) + 재귀함수 최악의 경우 한쪽으로만 노드가 이어지는 경우 O(n) = O(n)
1212

13-
/**
14-
* Definition for a binary tree node.
15-
* type TreeNode struct {
16-
* Val int
17-
* Left *TreeNode
18-
* Right *TreeNode
19-
* }
20-
*/
21-
2213
func buildTree(preorder []int, inorder []int) *TreeNode {
2314
inorderMap := make(map[int]int)
2415
for i, n := range inorder {
@@ -47,4 +38,3 @@ func buildTree(preorder []int, inorder []int) *TreeNode {
4738

4839
return recursive(0, 0, len(inorder)-1)
4940
}
50-

0 commit comments

Comments
 (0)