Skip to main content

Binary Tree Traversal in Python - In Order, Pre Order, Post Order

Binary Tree Traversal in Python - In Order, Pre Order, Post Order
Run the code here to see output: https://repl.it/@VinitKhandelwal/iterative-traversal-of-binary-tree
# Node Class to Create Object of Nodes
class Node():
def __init__(self, value, left=None, right=None):
self.value = value
self.left = left
self.right = right

# Creation of a Binary Tree
class BinaryTree():
def __init__(self, mylist):
self.mylist = mylist
self.root=Node(None)
for value in self.mylist:
self.curr=self.root
self._add(value)
def _add(self, value):
if self.curr.value == None:
self.curr.value = value
else:
if self.curr.value > value:
if self.curr.left == None:
self.curr.left = Node(value)
else:
self.curr = self.curr.left
self._add(value)
else:
if self.curr.right == None:
self.curr.right = Node(value)
else:
self.curr = self.curr.right
self._add(value)

obj = BinaryTree([20,10,30,15,5,25,35])

# Traversal Classes

# PostOrder Traversal
class Postorder():

def __init__(self, root):
self.root = root
self.curr = self.root
self._iterate(self.curr)
def _iterate(self, node):
if node.left != None:
self._iterate(node.left)
if node.right != None:
self._iterate(node.right)
print(node.value)

# PreOrder Traversal
class Preorder():

def __init__(self, root):
self.root = root
self.curr = self.root
self._iterate(self.curr)
def _iterate(self, node):
print(node.value)
if node.left != None:
self._iterate(node.left)
if node.right != None:
self._iterate(node.right)

# InOrder Traversal
class Inorder():

def __init__(self, root):
self.root = root
self.curr = self.root
self._iterate(self.curr)
def _iterate(self, node):
if node.left != None:
self._iterate(node.left)
print(node.value)
if node.right != None:
self._iterate(node.right)

# Running the traversals for output
print("Post Order")
Postorder(obj.root)
print("Pre Order")
Preorder(obj.root)
print("In Order")
Inorder(obj.root)

Output

Post Order
5
15
10
25
35
30
20
Pre Order
20
10
5
15
30
25
35
In Order
5
10
15
20
25
30
35

Comments

Popular posts from this blog

Python - List - Append, Count, Extend, Index, Insert, Pop, Remove, Reverse, Sort

🐍 Advance List List is widely used and it's functionalities are heavily useful. Append Adds one element at the end of the list. Syntax list1.append(value) Input l1 = [1, 2, 3] l1.append(4) l1 Output [1, 2, 3, 4] append can be used to add any datatype in a list. It can even add list inside list. Caution: Append does not return anything. It just appends the list. Count .count(value) counts the number of occurrences of an element in the list. Syntax list1.count(value) Input l1 = [1, 2, 3, 4, 3] l1.count(3) Output 2 It returns 0 if the value is not found in the list. Extend .count(value) counts the number of occurrences of an element in the list. Syntax list1.extend(list) Input l1 = [1, 2, 3] l1.extend([4, 5]) Output [1, 2, 3, 4, 5] If we use append, entire list will be added to the first list like one element. Extend, i nstead of considering a list as one element, it joins the two lists one after other. Append works in the following way. Input l1 = [1, 2, 3] l1.append([4, 5]) Output...

Difference between .exec() and .execPopulate() in Mongoose?

Here I answer what is the difference between .exec() and .execPopulate() in Mongoose? .exec() is used with a query while .execPopulate() is used with a document Syntax for .exec() is as follows: Model.query() . populate ( 'field' ) . exec () // returns promise . then ( function ( document ) { console . log ( document ); }); Syntax for .execPopulate() is as follows: fetchedDocument . populate ( 'field' ) . execPopulate () // returns promise . then ( function ( document ) { console . log ( document ); }); When working with individual document use .execPopulate(), for model query use .exec(). Both returns a promise. One can do without .exec() or .execPopulate() but then has to pass a callback in populate.

Python Class to Calculate Distance and Slope of a Line with Coordinates as Input

🐍  Can be run on Jupyter Notebook #CLASS DESIGNED TO CREATE OBJECTS THAT TAKES COORDINATES AND CALCULATES DISTANCE AND SLOPE class Line:     def __init__(self,coor1,coor2):         self.coor1=coor1         self.coor2=coor2 #FUNCTION CALCULATES DISTANCE     def distance(self):         return ((self.coor2[0]-self.coor1[0])**2+(self.coor2[1]-self.coor1[1])**2)**0.5 #FUNCTION CALCULATES SLOPE         def slope(self):         return (self.coor2[1]-self.coor1[1])/(self.coor2[0]-self.coor1[0]) #DEFINING COORDINATES coordinate1 = (3,2) coordinate2 = (8,10) #CREATING OBJECT OF LINE CLASS li = Line(coordinate1,coordinate2) #CALLING DISTANCE FUNCTION li.distance() #CALLING SLOPE FUNCTION li.slope()