From f1f04a647be072a2e9bb91032c29f307ce6d249f Mon Sep 17 00:00:00 2001
From: SudarshanRamanujam <sudharshanramanujam@gmail.com>
Date: Mon, 6 Dec 2021 01:28:35 +0530
Subject: [PATCH] Added Inorder recurrsion

---
 data_structures/binary_trees/traversals.py | 19 +++++++++++++++----
 1 file changed, 15 insertions(+), 4 deletions(-)

diff --git a/data_structures/binary_trees/traversals.py b/data_structures/binary_trees/traversals.py
index 5c26eb39..b03367a8 100644
--- a/data_structures/binary_trees/traversals.py
+++ b/data_structures/binary_trees/traversals.py
@@ -7,9 +7,20 @@ def __init__(self, val):
 
 
 class Tree:
+    """
+    Inoder Traversel(left Node,root Node,right Node)
+    """
+    def inorder(self,node):
+        if node is not None:
+           self.inorder(node.left)
+           print(node.val)
+           self.inorder(node.right)
 
-    def __init__(self, root):
-        self.root = root
 
-
-    def inorder()
+root=Node(5)
+root.left=Node(2)
+root.right=Node(7)
+root.left.left=Node(1)
+root.left.right=Node(4)
+t=Tree()
+t.inorder(root)