update posts

Author: dev-jonghoonpark

_posts/2024-06-23-leetcode-105.md

@@ -16,6 +16,8 @@ toc: true
 
 [https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)
 
+## 내가 작성한 풀이
+
 ```java
 class Solution {
 	public TreeNode buildTree(int[] preorder, int[] inorder) {

_posts/2024-06-23-leetcode-208.md

@@ -15,6 +15,8 @@ toc: true
 
 [https://leetcode.com/problems/implement-trie-prefix-tree/](https://leetcode.com/problems/implement-trie-prefix-tree/)
 
+## 내가 작성한 풀이
+
 ```java
 class Trie {
 

_posts/2024-06-23-leetcode-230.md

@@ -15,6 +15,8 @@ toc: true
 
 [https://leetcode.com/problems/kth-smallest-element-in-a-bst/](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)
 
+## 내가 작성한 풀이
+
 ```java
 class Solution {
 	public int kthSmallest(TreeNode root, int k) {

_posts/2024-06-23-leetcode-79.md

@@ -15,6 +15,8 @@ toc: true
 
 [https://leetcode.com/problems/word-search/](https://leetcode.com/problems/word-search/)
 
+## 내가 작성한 풀이
+
 ```java
 class Solution {
     public boolean exist(char[][] board, String word) {