Python-Datastructures/array_impl_Btree.py at master · vaibhavk1992/Python-Datastructures · 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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
# -*- coding: utf-8 -*-
"""
Created on Sat Apr 29 23:47:22 2017

@author: vaibhav
"""

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

class createbinarytree:

    def array(self):
        self.q=[]
        self.num=int(raw_input("enter the number of element you want in the list"))
        for i in range(0,self.num):
          self.num1=int(raw_input("enter the " + `i+1` +"element"))
          self.q.append(self.num1)

    def createtree(self):
        z=[]
        arr_len=len(self.q)
        k=0
        root_data=self.q[0]
        self.top=createnode(root_data)
        z.append(self.top)

        while(k<arr_len):

           parent=z.pop(0)
           x=2*k+1

           if(x<arr_len):

            left_data=self.q[x]
            self.left_child=createnode(left_data)
            z.append(self.left_child)
            parent.left=self.left_child
           y=2*k+2
           if(y<arr_len):
            right_data=self.q[y]
            self.right_child=createnode(right_data)
            z.append(self.right_child)
            parent.right=self.right_child

           k=k+1


    def inordertraversse(self,top):
           if(top):
            self.inordertraversse(top.left)
            print(top.root)
            self.inordertraversse(top.right)

    def preordertraversse(self,top):
           if(top):
            print(top.root)
            self.preordertraversse(top.left)
            self.preordertraversse(top.right)
    def postordertraversse(self,top):
           if(top):
            self.postordertraversse(top.left)
            self.postordertraversse(top.right)
            print(top.root)


conv=createbinarytree();
conv.array()
conv.createtree()
print("the inorder traversal is ")
conv.inordertraversse(conv.top)
print("the preorder traversal is ")
conv.preordertraversse(conv.top)
print("the postorder traversal is ")
conv.postordertraversse(conv.top)