Tree


  • Overview of Trees
  • Terminologies
  • Types of Trees
  • Tree Traversals
  • Traversals-Illustration
  • Binary Trees
  • Types of Binary Trees
  • Implementation in Python
  • Binary Tree Traversals
  • Implementation of Binary Trees
  • Applications of Binary trees
  • Binary Search Trees
  • Implementation Of BST

    • Practice Questions

    Implementation Of BST

    class BinarySearchTreeNode:
                def __init__(self,data):
        self.data=data
        self.left=None
        self.right=None
               def add_child(self,data):
                     if data==self.data:
                           return
                    if data < self.data:
                           #add data in left subtree
                           if self.left:
                                 self.left.add_child(data)
                          else:
                                self.left=BinarySearchTreeNode(data)
      else:
            if self.right:
                  self.right.add_child(data)
           else:
                 self.right=BinarySearchTreeNode(data)
     
     
     

    Try here>>>