FilesExpand file tree

 master

/

1028.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

33 lines (29 loc) · 897 Bytes

 master

/

1028.py

Copy path

Top

File metadata and controls

• Code
• Blame

33 lines (29 loc) · 897 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

# Definition for a binary tree node.

# class TreeNode:

# def __init__(self, x):

# self.val = x

# self.left = None

# self.right = None

import collections

class Solution:

def recoverFromPreorder(self, S: str) -> TreeNode:

q = collections.deque()

S = S + '-'

count = 0

left = 0

for i in range(0, len(S)):

if S[i] == '-':

if left != i:

q.append((S[left:i], count))

count = 0

count += 1

left = i+1;

# bit

def build_tree(depth):

if not len(q) or q[0][1] != depth:

return None

root = TreeNode(q.popleft()[0])

root.left = build_tree(depth+1)

root.right = build_tree(depth+1)

return root

return build_tree(0)