Updated Binary Tree Implementation

Author: sushant097

Tree/BinaryTree.py renamed to Tree/BinaryTreeLL.py

@@ -122,6 +122,7 @@ def insertNodeBT(rootNode, newNode):
                 return "New Value inserted sucessfully!"
 
 def getFarthestNode(rootNode):
+    # Time: O(n); Space: O(n)
     if not rootNode:
         return
     else:
@@ -137,6 +138,77 @@ def getFarthestNode(rootNode):
         # the last node is farthest among all
         return root.value
 
+def deleteFarthestNode(rootNode, fNode):
+    # Time: O(n); Space: O(n)
+    if not rootNode:
+        return 
+
+    else:
+        customQueue = Queue()
+        customQueue.enqueue(rootNode)
+        while not customQueue.isEmpty():
+            root = customQueue.dequeue()
+
+            if root.value is fNode:
+                root.value = None
+                return 
+            if root.value.rightChild:
+                if root.value.rightChild is fNode:
+                    root.value.rightChild = None
+                    return 
+                else:
+                    customQueue.enqueue(root.value.rightChild)
+
+                if root.value.leftChild:
+                    if root.value.leftChild is fNode:
+                        root.value.leftChild = None
+                        return 
+                    else:
+                        customQueue.enqueue(root.value.leftChild)
+
+def deleteNodeBT(rootNode, node):
+    # We use LevelOrderTraversal to search node
+    # If we found the node to delete
+    # We get the farthest node and
+    # Replace node to delete with farthest node
+    # And delete farthest node
+    # Note: We can't directly delete the given node since
+    #       Other nodes linked with it also gets deleted
+    # Time: O(n); Space: O(n)
+    if not rootNode:
+        return "The BT does not exist"
+    else:
+        customQueue = Queue()
+        customQueue.enqueue(rootNode)
+        while not customQueue.isEmpty():
+            root = customQueue.dequeue()
+            if root.value.data == node:
+                dNode = getFarthestNode(rootNode)
+                root.value.data = dNode.data
+                deleteFarthestNode(rootNode, dNode)
+                return "The node has been sucesfully deleted"
+            
+            if root.value.leftChild is not None:
+                customQueue.enqueue(root.value.leftChild)
+            if root.value.rightChild is not None:
+                customQueue.enqueue(root.value.rightChild)
+        return "Failed to delete"
+
+def deleteEntireBT(rootNode):
+    # We have implemented BT with linked list
+    # Simply make rootNode -> None
+    # And left child and right child of rootNode both -> None
+    # This will delete entire BT by garbage collector
+    # Time: O(1); Space: O(1)
+    if not rootNode:
+        return "The BT does not exist"
+    
+    rootNode.data = None
+    rootNode.leftChild = None
+    rootNode.rightChild = None
+
+    return "Sucessfully deletion of entire BT."
+
 preOrderTraversal(BT)
 print("###########")
 inOrderTraversal(BT)
@@ -153,4 +225,15 @@ def getFarthestNode(rootNode):
 levelOrderTraversal(BT)
 print("#########")
 farthestNode = getFarthestNode(BT)
-print(farthestNode.data)
+print(farthestNode.data)
+print("######")
+# deleteFarthestNode(BT, farthestNode)
+# levelOrderTraversal(BT)
+# print("####")
+
+deleteNodeBT(BT, 'Mobile')
+levelOrderTraversal(BT)
+# Deletion of Entire BT
+print("##########")
+deleteEntireBT(BT)
+levelOrderTraversal(BT)

Tree/BinaryTreePL.py

@@ -0,0 +1,36 @@
+
+"Creation of Binary Tree using Python List"
+class BinaryTree:
+    def __init__(self, size) -> None:
+        self.customList = size * [None]
+        self.lastUsedIndex = 0
+        self.maxSize = size
+    
+    def insertNode(self, value):
+        #  Two Case: Either BT is full or there is vacant place to insert new node
+        # We use level order traversal to search for the first vacant place.
+        # And add using lastUsedIndex
+        if self.lastUsedIndex + 1 == self.maxSize:
+            return "The Binary Tree is full"
+        
+        self.customList[self.lastUsedIndex+1] = value
+        self.lastUsedIndex += 1
+        return "The value has been successfully inserted"
+    
+    def searchNode(self, nodeValue):
+        # Search through the list
+        # if found return Sucess message
+        # TIme: O(n); Space: O(1)
+        for i in range(len(self.customList)):
+            if self.customList[i] == nodeValue:
+                return "Success"
+        return "Value not found"
+
+BT = BinaryTree(size=8)
+print(BT.insertNode("Gadgets"))
+print(BT.insertNode("Ipad"))
+print(BT.insertNode("Mobile"))
+print(BT.insertNode("IpadEarphone"))
+print("####")
+print(BT.searchNode("Mobile"))
+