diff --git a/Tree_Postorder_Traversal/Tree_Postorder_Traversal.ts b/Tree_Postorder_Traversal/Tree_Postorder_Traversal.ts
index 78cdd2e131..024a2a6381 100644
--- a/Tree_Postorder_Traversal/Tree_Postorder_Traversal.ts
+++ b/Tree_Postorder_Traversal/Tree_Postorder_Traversal.ts
@@ -11,7 +11,6 @@ interface treeNodes
     right?: treeNodes;  
 }
 
-
 // Defining the nodes with their values and left right children. If a value is not given it is undefined.
 const node11: treeNodes = { val: 11 };
 const node10: treeNodes = { val: 10 };
@@ -53,7 +52,6 @@ function postOrderTraversal(currentNode: treeNodes)
     console.log(currentNode.val + " -> ");
 }
 
-
 constructBinaryTree();
 console.log("The postorder traversal of the binary tree is :");
 postOrderTraversal(root);
@@ -72,4 +70,4 @@ The postorder traversal of the binary tree is :
 7 -> 
 3 -> 
 1 ->
-*/
\ No newline at end of file
+*/