From 8d3ce0aef381949dfea76fcce180fd4f7b7e51a5 Mon Sep 17 00:00:00 2001 From: anujpuri72 Date: Tue, 2 Jun 2020 14:24:16 +0530 Subject: [PATCH 1/2] Added June 1 code --- JuneChallenge/InvertBinaryTree.py | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 JuneChallenge/InvertBinaryTree.py 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 From fba9bb6e1141e225a1ff303fd18d56ef71f7af1c Mon Sep 17 00:00:00 2001 From: anujpuri72 Date: Tue, 2 Jun 2020 14:26:21 +0530 Subject: [PATCH 2/2] Added June2 code --- JuneChallenge/Delete Node in a Linked List.py | 5 +++++ 1 file changed, 5 insertions(+) create mode 100644 JuneChallenge/Delete Node in a Linked List.py 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