Upstream Merge

.gitignore

@@ -0,0 +1 @@
+__pycache__/

README.md

@@ -1,8 +1,9 @@
 # Exercises
 
-## Modules
-* Introduction And Environment
-* Introduction To Python
-* Data Structures
-* Algorithms
-* Software Theory
+| Module ID | Module Name |
+|:-----------:|:--------:|
+| 1 | [Introduction and Environment](https://github.com/ByteAcademyCo/Exercises/tree/master/introduction_and_environment) |
+| 2 | [Introduction to Python](https://github.com/ByteAcademyCo/Exercises/tree/master/introduction_to_python) |
+| 3 | [Data Structures](https://github.com/ByteAcademyCo/Exercises/tree/master/data_structures) |
+| 4 | [Algorithms](https://github.com/ByteAcademyCo/Exercises/tree/master/algorithms) |
+| 5 | [Software Theory](https://github.com/ByteAcademyCo/Exercises/tree/master/software_theory) |

algorithms/README.md

@@ -1,8 +1,9 @@
 # Exercise Organization
 
-## Exercise Sections
-* Graph Traversal
-* Sorting
-* Bit Manipulation
-* String Manipulation
-* Dynamic Programming
+| Section ID | Section Name |
+|:-----------:|:--------:|
+| 1 | [Graph Traversals](https://github.com/ByteAcademyCo/Exercises/tree/master/algorithms/graph_traversal) |
+| 2 | [Sorting](https://github.com/ByteAcademyCo/Exercises/tree/master/algorithms/sorting) |
+| 3 | [Bit Manipulation](https://github.com/ByteAcademyCo/Exercises/tree/master/algorithms/bit_manipultion) |
+| 4 | [String Manipulation](https://github.com/ByteAcademyCo/Exercises/tree/master/algorithms/string_manipulation) |
+| 5 | [Dynamic Programming](https://github.com/ByteAcademyCo/Exercises/tree/master/algorithms/dynamic_programming) |

data_structures/binary_trees/1_Binary_Search/README.md

@@ -0,0 +1,15 @@
+# Binary Search
+
+## Motivation
+
+
+# Problem Description
+Write a Python program to find the value in a given non-empty Binary Search Tree (BST) of unique values.
+Program should return value is found if value is present in tree.
+
+
+# Testing
+* 
+
+## Submission
+* Submit your answers in the *solution.py* file within the *Solutions* subdirectory within this directory

data_structures/binary_trees/1_Binary_Search/Solution/solution.py

@@ -0,0 +1,53 @@
+class Node:
+
+    def __init__(self, data):
+
+        self.left = None
+        self.right = None
+        self.data = data
+
+# Insert method to create nodes
+    def insert(self, data):
+
+        if self.data:
+            if data < self.data:
+                if self.left is None:
+                    self.left = Node(data)
+                else:
+                    self.left.insert(data)
+            elif data > self.data:
+                if self.right is None:
+                    self.right = Node(data)
+                else:
+                    self.right.insert(data)
+        else:
+            self.data = data
+# findval method to compare the value with nodes
+    def findval(self, lkpval):
+        if lkpval < self.data:
+            if self.left is None:
+                return str(lkpval)
+            return self.left.findval(lkpval)
+        elif lkpval > self.data:
+            if self.right is None:
+                return str(lkpval)
+            return self.right.findval(lkpval)
+        else:
+            return self.data
+# Print the tree
+    def PrintTree(self):
+        if self.left:
+            self.left.PrintTree()
+        print( self.data),
+        if self.right:
+            self.right.PrintTree()
+
+
+root = Node(12)
+root.insert(6)
+root.insert(14)
+root.insert(3)
+ele = input()
+element = int(ele)
+result = root.findval(element)
+print(result)

data_structures/binary_trees/1_Binary_Search/Solution/test_solution.py

@@ -0,0 +1,21 @@
+def test_solution(monkeypatch):
+    a = None
+    x = 2
+
+    def g(num1):
+        nonlocal a 
+        a = num1 
+
+    def f():
+
+        nonlocal x
+        return x
+
+    monkeypatch.setattr('builtins.print',g)
+
+    monkeypatch.setattr('builtins.input',f)
+
+    import solution
+    assert solution.ele==x
+
+

data_structures/binary_trees/1_Create_BT_Node/README.md

@@ -0,0 +1,11 @@
+# Create Binary Tree With Node
+
+## Motivation
+# Problem Description
+ Write a Python program that creates Binary Tree with Node
+
+# Testing
+* 
+
+## Submission
+* Submit your answers in the *solution.py* file within the *Solutions* subdirectory within this directory

data_structures/binary_trees/1_Create_BT_Node/Solution/solution.py

@@ -0,0 +1,15 @@
+class Node:
+
+    def __init__(self, data):
+
+        self.left = None
+        self.right = None
+        self.data = data
+
+
+    def PrintTree(self):
+        print(self.data)
+
+root = Node(10)
+
+root.PrintTree()

data_structures/binary_trees/1_Create_BT_Node/Solution/test_solution.py

@@ -0,0 +1,10 @@
+def test_solution(monkeypatch):
+    a = None
+
+    def g(num1):
+        nonlocal a 
+        a = num1
+
+    monkeypatch.setattr('builtins.print',g)
+
+    import solution

data_structures/binary_trees/1_Insert_into_Tree/READE.md

@@ -0,0 +1,12 @@
+# Insert Values Into a tree
+## Motivation
+
+
+# Problem Description
+Write a Python program insert values into Binary Tree
+
+# Testing
+* 
+
+## Submission
+* Submit your answers in the *solution.py* file within the *Solutions* subdirectory within this directory

data_structures/binary_trees/1_Insert_into_Tree/Solution/solution.py

@@ -0,0 +1,39 @@
+class Node:
+
+    def __init__(self, data):
+
+        self.left = None
+        self.right = None
+        self.data = data
+
+    def insert(self, data):
+# Compare the new value with the parent node
+        if self.data:
+            if data < self.data:
+                if self.left is None:
+                    self.left = Node(data)
+                else:
+                    self.left.insert(data)
+            elif data > self.data:
+                if self.right is None:
+                    self.right = Node(data)
+                else:
+                    self.right.insert(data)
+        else:
+            self.data = data
+
+# Print the tree
+    def PrintTree(self):
+        if self.left:
+            self.left.PrintTree()
+        return self.data
+        if self.right:
+            self.right.PrintTree()
+
+# Use the insert method to add nodes
+root = Node(12)
+root.insert(6)
+root.insert(14)
+root.insert(3)
+result = root.PrintTree()
+print(result)

data_structures/binary_trees/1_Insert_into_Tree/Solution/test_solution.py

@@ -0,0 +1,9 @@
+def test_solution(monkeypatch):
+    a = None
+
+    def g(num1):
+        nonlocal a
+        a = num1
+    monkeypatch.setattr('builtins.print',g)
+
+    import solution

data_structures/binary_trees/2_Inorder_Travesal/README.md

@@ -0,0 +1,12 @@
+# Inorder Traversal
+## Motivation
+
+
+# Problem Description
+Write a Python program to perform Inoreder Trversal on Bonary Tree.
+
+# Testing
+* 
+
+## Submission
+* Submit your answers in the *solution.py* file within the *Solutions* subdirectory within this directory