effective-python/binary-tree.py at master · enicolasgomez/effective-python · 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
class Node:
  def __init__(self, value):
    self.data = value
    self.left = None
    self.right = None

  def PrintPreOrder(self, indent, last):
    print(indent, end='')

    if last:
      print("└─", end='')
      indent = indent.join("  ")
    else:
      print("├─", end='')
      indent = indent.join("| ")

    print(self.data)

    children = []

    if self.left:
      children.append(self.left)
    if self.right:
      children.append(self.right)

    for i,n in enumerate(children):
      n.PrintPreOrder(indent, i == len(children) -1 )

class BinaryTree:
  def __init__(self, list):
    self.root = Node(list[0])
    for i in list:
      self.addNode(self.root, i)

  def Print(self):
    self.root.PrintPreOrder("", True)

  def addNode(self, node, value):
    if value < node.data:
      if node.left == None:
        node.left = Node(value)
      else:
        self.addNode(node.left, value)
    else:
      if node.right == None:
        node.right = Node(value)
      else:
        self.addNode(node.right, value)

treeValues = [ 10, 5, 15, 7, 2, 9, 31 ]
tree = BinaryTree(treeValues)
tree.Print()