Inorder Traversal of Binary Tree

Inorder traversal is defined as a type of tree traversal technique which follows the Left-Root-Right pattern, such that:
The left subtree is traversed first
Then the root node for that subtree is traversed
Finally, the right subtree is traversed

Author: Rahitya5

Inorder Traversal of Binary Tree

@@ -13,6 +13,14 @@ class BinaryTree:
             self._inorder_recursive(node.left)
             print(node.value,end="->")
             self._inorder_recursive(node.right)
+    # DEPTH/HEIGHT OF TREE
+    def height(self,node):
+        if node is None:
+            return 0 
+        else:
+            left_height=self.height(node.left)
+            right_height=self.height(node.right)
+            return max(left_height,right_height)+1
 
 #Create nodes 
 root=Node(10)
@@ -25,3 +33,4 @@ root.right.right=Node(54)
 tree=BinaryTree()
 tree.root1=root
 print(tree._inorder_recursive(tree.root1))
+print(tree.height(tree.root1))