FilesExpand file tree

master

/

1008.先序遍历构造二叉树.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

15 lines (15 loc) · 597 Bytes

master

/

1008.先序遍历构造二叉树.py

Copy path

Top

File metadata and controls

• Code
• Blame

15 lines (15 loc) · 597 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

# 列表第一个值构造为根结点，比根结点小的值作为左子树，比根结点大的值作为右子树，递归构造结点成二叉树

class Solution(object):

def bstFromPreorder(self, preorder):

if not preorder:

return None

root = TreeNode(preorder[0])

left, right = [], []

for num in preorder[1:]:

if num < preorder[0]:

left.append(num)

else:

right.append(num)

root.left = self.bstFromPreorder(left)

root.right = self.bstFromPreorder(right)

return root