diff --git a/JuneChallenge/Delete Node in a Linked List.py b/JuneChallenge/Delete Node in a Linked List.py
new file mode 100644
index 0000000..a2d8b26
--- /dev/null
+++ b/JuneChallenge/Delete Node in a Linked List.py	
@@ -0,0 +1,5 @@
+
+class Solution:
+    def deleteNode(self, node):
+        node.val = node.next.val
+        node.next = node.next.next
diff --git a/JuneChallenge/InvertBinaryTree.py b/JuneChallenge/InvertBinaryTree.py
new file mode 100644
index 0000000..da22ab3
--- /dev/null
+++ b/JuneChallenge/InvertBinaryTree.py
@@ -0,0 +1,21 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+
+
+class Solution:
+    def invert(self, root: TreeNode):
+        if(root == None):
+            return
+        else:
+            root.left, root.right = root.right, root.left
+            self.invert(root.right)
+            self.invert(root.left)
+            return root
+
+    def invertTree(self, root: TreeNode) -> TreeNode:
+        a = self.invert(root)
+        return a