cc150/4.4.tree_level_ls.py at master · buy/cc150 · GitHub

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
# 8:47
from basic import *

class Node:
  def __init__(self, data=None):
    self.data = data
    self.left = None
    self.right = None

def getLinkedList(root=None):
  if root is None:
    return None

  level = 0
  root.level = level
  queue = [root]
  output = []
  levelOutput = []

  while queue:
    temp = queue.pop(0)
    if temp.level > level:
      level = temp.level
      output.append(levelOutput)
      levelOutput = []
      levelOutput.append(temp.data)
    else:
      levelOutput.append(temp.data)

    if temp.left:
      temp.left.level = level + 1
      queue.append(temp.left)

    if temp.right:
      temp.right.level = level + 1
      queue.append(temp.right)

  if levelOutput:
    output.append(levelOutput)

  return output


if __name__ == '__main__':
  t = BinaryTree()
  t.add(Node(5))
  t.add(Node(3))
  t.add(Node(1))
  t.add(Node(4))
  t.add(Node(8))

  list = getLinkedList(t.root)
  print list