From ccd93ddbde59f653a9156b4ce0081eb98525c4a8 Mon Sep 17 00:00:00 2001
From: Nishant Kaushal <101548649+nishant0708@users.noreply.github.com>
Date: Tue, 23 Jul 2024 20:00:11 +0530
Subject: [PATCH] fixed

---
 .../0100-0199/0106-construct-binary-tree-from-inorder.md         | 1 +
 1 file changed, 1 insertion(+)

diff --git a/dsa-solutions/lc-solutions/0100-0199/0106-construct-binary-tree-from-inorder.md b/dsa-solutions/lc-solutions/0100-0199/0106-construct-binary-tree-from-inorder.md
index 8c23f27bb..e2d77e10a 100644
--- a/dsa-solutions/lc-solutions/0100-0199/0106-construct-binary-tree-from-inorder.md
+++ b/dsa-solutions/lc-solutions/0100-0199/0106-construct-binary-tree-from-inorder.md
@@ -14,6 +14,7 @@ description: "Given two integer arrays inorder and postorder where inorder is th
 ---
 
 
+
 ### Problem Description
 
 Given two integer arrays inorder and postorder where inorder is the inorder traversal of a binary tree and postorder is the postorder traversal of the same tree, construct and return the binary tree.