python/binarytree.py at main · yadavrahulrao/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
class treenode :
  def __init__(self,data):
    self.data = data
    self.left = None
    self.right = None

root = treenode('r')
nodeA = treenode('a')
nodeB = treenode('b')
nodeC = treenode('c')
nodeD = treenode('d')
nodeE = treenode('e')
nodeF = treenode('f')


root.left = nodeA
root.right = nodeB

nodeA.left = nodeC
nodeA.right = nodeD

nodeB.left = nodeE
nodeB.right = nodeF

print("root right left data :",root.right.left.data)


def preorder(node):
  if node is None:
    return
  print(node.data,end=", ")
  preorder(node.left)
  preorder(node.right)


def inorder(node):
  if node is None:
    return
  inorder(node.left)
  inorder(node.data,end=" ,")
  inorder(node.right)


def postorder(node):
  if node is None:
    return
  postorder(node.left)
  postorder(node.right)
  postorder(node.data,end = " ,")