diff --git a/binary-tree-level-order-traversal/README.md b/binary-tree-level-order-traversal/README.md
new file mode 100644
index 000000000..d6dfb4d74
--- /dev/null
+++ b/binary-tree-level-order-traversal/README.md
@@ -0,0 +1,2 @@
+- 문제: https://leetcode.com/problems/binary-tree-level-order-traversal/
+- 풀이: https://www.algodale.com/problems/binary-tree-level-order-traversal/
\ No newline at end of file
diff --git a/lowest-common-ancestor-of-a-binary-search-tree/README.md b/lowest-common-ancestor-of-a-binary-search-tree/README.md
new file mode 100644
index 000000000..eade1aada
--- /dev/null
+++ b/lowest-common-ancestor-of-a-binary-search-tree/README.md
@@ -0,0 +1,2 @@
+- 문제: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/
+- 풀이: https://www.algodale.com/problems/lowest-common-ancestor-of-a-binary-search-tree/
\ No newline at end of file
diff --git a/remove-nth-node-from-end-of-list/README.md b/remove-nth-node-from-end-of-list/README.md
new file mode 100644
index 000000000..471ba984f
--- /dev/null
+++ b/remove-nth-node-from-end-of-list/README.md
@@ -0,0 +1,2 @@
+- 문제: https://leetcode.com/problems/remove-nth-node-from-end-of-list/
+- 풀이: https://www.algodale.com/problems/remove-nth-node-from-end-of-list/
\ No newline at end of file
diff --git a/reorder-list/README.md b/reorder-list/README.md
new file mode 100644
index 000000000..8844380a5
--- /dev/null
+++ b/reorder-list/README.md
@@ -0,0 +1,2 @@
+- 문제: https://leetcode.com/problems/reorder-list/
+- 풀이: https://www.algodale.com/problems/reorder-list/
\ No newline at end of file
diff --git a/validate-binary-search-tree/README.md b/validate-binary-search-tree/README.md
new file mode 100644
index 000000000..0f471f14b
--- /dev/null
+++ b/validate-binary-search-tree/README.md
@@ -0,0 +1,2 @@
+- 문제: https://leetcode.com/problems/validate-binary-search-tree/
+- 풀이: https://www.algodale.com/problems/validate-binary-search-tree/
\ No newline at end of file