Search
 
SCRIPT & CODE EXAMPLE
 

PYTHON

tree implementation in python

class Tree:
  def __init__(self, val = None):
    if val != None:
	    self.val = val
    else:
        self.val = None
    self.left = None
    self.right = None

  def insert(self, val):
    if self.val:
        if val < self.val:
            if self.left is None:
            	self.left = Tree(val)
            else:
            	self.left.insert(val)
        elif val > self.val:
        		if self.right is None:
              self.right = Tree(val)
            else:
              self.right.insert(val)
    else:
        self.val = val

  def printValues(self):
    if self.left:
        self.left.printValues()
    print(self.val)
    if self.right:
        self.right.printValues()

tree = Tree(20)
tree.left = Tree(18)
tree.right = Tree(22)
tree.insert(19)
tree.insert(24)
tree.insert(5)
tree.insert(21)

tree.printValues()
Comment

Data Structure tree in python

class Node:
     def __init__(self,data):
          self.data = data
          self.parent = None
          self.left = None
          self.right = None

     def __repr__(self):
          return repr(self.data)

     def add_left(self,node):
         self.left = node
         if node is not None:
             node.parent = self

     def add_right(self,node):
         self.right = node
         if node is not None:
             node.parent = self
'''
Example:
          _2_
        /       
       7         9
      /          
     1   6         8
         /        / 
       5   10   3   4
'''
def create_tree():
    two = Node(2)
    seven = Node(7)
    nine = Node(9)
    two.add_left(seven)
    two.add_right(nine)
    one = Node(1)
    six = Node(6)
    seven.add_left(one)
    seven.add_right(six)
    five = Node(5)
    ten = Node(10)
    six.add_left(five)
    six.add_right(ten)
    eight = Node(8)
    three = Node(3)
    four = Node(4)
    nine.add_right(eight)
    eight.add_left(three)
    eight.add_right(four)

    # now return the root node
    return two

def pre_order(node):
    print(node)
    if node.left:
        pre_order(node.left)
    if node.right:
        pre_order(node.right)

def in_order(node):
    if node.left:
        in_order(node.left)
    print(node)
    if node.right:
        in_order(node.right)

def post_order(node):
    if node.left:
        post_order(node.left)
    if node.right:
        post_order(node.right)
    print(node)

if __name__ == "__main__":
    root = create_tree()
    print("
Pre-order traversal:")
    pre_order(root)
    print("
In-order traversal:")
    in_order(root)
    print("
Post-order traversal:")
    post_order(root)
Comment

PREVIOUS NEXT
Code Example
Python :: install pyimagesearch python3 
Python :: max value of a list prolog 
Python :: docker compose cron 
Python :: nan vs nat pandas 
Python :: push button raspberry pi 
Python :: double underscore methods python 
Python :: negative slicing in python 
Python :: ++ in python 
Python :: make Python class serializable 
Python :: polymorphism in python 
Python :: explode function in python 
Python :: request foucus tkinter widget 
Python :: python dict delete key 
Python :: python types 
Python :: how to find the last occurrence of a character in a string in python 
Python :: flask form options 
Python :: python string: .strip() 
Python :: getting current user in django 
Python :: shape of variable python 
Python :: object oriented programming python 
Python :: Sort index values with pandas 
Python :: how to standardize the image data to have values between 0 and 1 
Python :: plotly change legend name 
Python :: variable python 
Python :: variable referenced before assignment python 
Python :: python copy vs deepcopy 
Python :: float field vs decimal field in django models 
Python :: find position of key in dictionary python 
Python :: python array append array 
Python :: Creating lambda expressions in comprehension list 
ADD CONTENT
Topic
Content
Source link
Name
8+9 =