Implemention of Binary Tree using Python

Implemention of Binary Tree Using Python 

The Python code is according to python 2.7

In computer science, a binary tree is tree data structure in which each node has at most two childe,each one referred a left child and right child
Each node contain three parts :-
1)Address of node on his left size 2)Value stored by node 3)Address of node on his right size
The Tree Represention Is As :->

PYTHON CODES

Code For creating Binary Tree

This code is only for creating the tree .If u try to run this u don't get any output on terminal I Know gays....the code is bit large .but i try my best to mini. it. class TreeNode: def __init__(self,value): self.lnode=None self.rnode=None self.value=value class Tree: def __init__(self): self.root=None def getRoot(self): return self.root #To check if root is available #-or not while inserting nod def AddNode(self,value): if(self.root==None): self.root=TreeNode(value) else: self._AddNode(value,self.root) def _AddNode(self,value,node): if (value<node.value): if(node.lnode!=None): self._AddNode(value,node.lnode) else: node.lnode=TreeNode(value) else: if(node.rnode!=None): self._AddNode(value,node.rnode) else: node.rnode=TreeNode(value) #most importent part of Program tree=Tree() #creating tree object name "tree" #creating tree print 'No of node to add' count=input('>') print 'Enter node value' for x in xrange(0,count): pp=input(">") tree.AddNode(pp)

Code For creating Binary Tree with Printing in diferrent form

I use Overloading in the printing the Triee in different form

• In-Order
• Pre-Order
• Post-Order

class TreeNode: def __init__(self,value): self.lnode=None self.rnode=None self.value=value class Tree: def __init__(self): self.root=None def getRoot(self): return self.root #To check if root is available #-or not while inserting nod def AddNode(self,value): if(self.root==None): self.root=TreeNode(value) else: self._AddNode(value,self.root) def _AddNode(self,value,node): if (value<node.value): if(node.lnode!=None): self._AddNode(value,node.lnode) else: node.lnode=TreeNode(value) else: if(node.rnode!=None): self._AddNode(value,node.rnode) else: node.rnode=TreeNode(value) def printTree(self,j=None): if (self.root!=None and j==None): self._printTree(self.root) elif(j==1): self._printTree1(self.root) elif(j==2): self._printTree2(self.root) else: print 'Tree is Empty' #in-order trivers code def _printTree(self,node): if(node!=None): self._printTree(node.lnode) print str(node.value), self._printTree(node.rnode) def _printTree1(self,node): if(node!=None): print str(node.value), self._printTree(node.lnode) self._printTree(node.rnode) def _printTree2(self,node): if(node!=None): self._printTree(node.lnode) self._printTree(node.rnode) print str(node.value), #most importent part of Program tree=Tree() #creating tree object name "tree" #creating tree print 'No of node to add' count=input('>') print 'Enter node value' for x in xrange(0,count): pp=input(">") tree.AddNode(pp) #print tree print 'Print Tree in IN-ORDER :-', tree.printTree() print "" print 'Print Tree in Pre-Order :-', tree.printTree(1) print "" print 'Print Tree in Post-Order :-', tree.printTree(2)

Output:-
C:\Users\rushi\Desktop\mypyDec>python bt2.py
No of node to add
>6
Enter node value
>70
>40
>80
>15
>50
>75
Print Tree in IN-ORDER :- 15 40 50 70 75 80
Print Tree in Pre-Order :- 70 15 40 50 75 80
Print Tree in Post-Order :- 15 40 50 75 80 70

C:\Users\rushi\Desktop\mypyDec>