diff --git a/java/106-Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.java b/java/106-Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.java
index e0fee2f2d..4112747f7 100644
--- a/java/106-Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.java
+++ b/java/106-Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.java
@@ -1,5 +1,3 @@
-//This video helped https://www.youtube.com/watch?v=LgLRTaEMRVc&ab_channel=takeUforward
-
 class Solution {
 
     public TreeNode buildTree(int[] inorder, int[] postorder) {