LeetCode-in-All · Dec 10, 2024
diff --git a/‎README.md
+415-415 b/‎README.md
+415-415
diff --git a/‎src/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/readme.md
+1-1 b/‎src/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/readme.md
+1-1
@@ -66,7 +66,7 @@ class Solution {
     }
 
     // Recursive helper method to construct binary tree
-    private TreeNode build(int[] preorder, int[] inorder, int preStart, preEnd, int inStart, int inEnd) {
+    private TreeNode build(int[] preorder, int[] inorder, int preStart, int preEnd, int inStart, int inEnd) {
         if (preStart > preEnd || inStart > inEnd) return null; // Base case
 
         int rootValue = preorder[preStart]; // Root node value
Original file line number	Diff line number	Diff line change
`@@ -66,7 +66,7 @@ class Solution {`
`66`	`66`	`}`
`67`	`67`
`68`	`68`	`// Recursive helper method to construct binary tree`
`69`		`- private TreeNode build(int[] preorder, int[] inorder, int preStart, preEnd, int inStart, int inEnd) {`
	`69`	`+ private TreeNode build(int[] preorder, int[] inorder, int preStart, int preEnd, int inStart, int inEnd) {`
`70`	`70`	`if (preStart > preEnd \|\| inStart > inEnd) return null; // Base case`
`71`	`71`
`72`	`72`	`int rootValue = preorder[preStart]; // Root node value`