diff --git a/arai60/binary-tree-zigzag-level-order-traversal/README.md b/arai60/binary-tree-zigzag-level-order-traversal/README.md
new file mode 100644
index 0000000..78589b1
--- /dev/null
+++ b/arai60/binary-tree-zigzag-level-order-traversal/README.md
@@ -0,0 +1,29 @@
+## 考察
+- 初見の問題
+- 方針
+    - BFS
+        - レベルごとに探索して、levelを0始まりで考えたときに奇数なら逆順にして答えに追加すれば良さそう
+        - 各reverse処理の計算量は要素数オーダーかかるが、全体としてはノード数で抑えられるので、amortized O(1)
+        - time: O(n), space: O(n)
+    - DFS
+        - DFSでも出来るが、前回同様DFSで解くメリットは特にない
+        - DFSは前回書いたので今回はスキップ
+- BFSで、vectorを2つ用意する形で実装する
+
+## Step1
+- 他の人のPRを検索
+    - https://github.com/fhiyo/leetcode/pull/29
+        - 文字通りzigzagにtraverseしている
+            - おそらくこれが想定解
+            - どうやって考えたら思い付けるか落とし込むことが出来なかったので、一旦覚える
+        - from_leftを用意している
+            - levelの偶奇で判定するより可読性が高そう
+    - https://github.com/YukiMichishita/LeetCode/pull/11
+        - reverseしなくてもdequeを使えば、逆順になる
+    - https://github.com/sakupan102/arai60-practice/pull/28
+- `step2_zigzag_traverse.cpp` と `spte2_deque.cpp` を追加
+
+## Step3
+- 1回目: 3m52s
+- 2回目: 3m20s
+- 3回目: 3m25s
diff --git a/arai60/binary-tree-zigzag-level-order-traversal/step1.cpp b/arai60/binary-tree-zigzag-level-order-traversal/step1.cpp
new file mode 100644
index 0000000..53dcef1
--- /dev/null
+++ b/arai60/binary-tree-zigzag-level-order-traversal/step1.cpp
@@ -0,0 +1,36 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+public:
+    vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
+        if (!root) return {};
+        vector<TreeNode*> nodes_to_visit;
+        nodes_to_visit.push_back(root);
+        vector<vector<int>> answer;
+        int level = 0;
+        while (!nodes_to_visit.empty()) {
+            vector<int> values_in_level;
+            vector<TreeNode*> nodes_in_next_level;
+            for (int i = 0; i < nodes_to_visit.size(); i++) {
+                TreeNode* node = nodes_to_visit[i];
+                values_in_level.push_back(node->val);
+                if (node->left) nodes_in_next_level.push_back(node->left);
+                if (node->right) nodes_in_next_level.push_back(node->right);
+            }
+            if (level % 2 == 1) reverse(values_in_level.begin(), values_in_level.end());
+            answer.push_back(move(values_in_level));
+            swap(nodes_to_visit, nodes_in_next_level);
+            level++;
+        }
+        return answer;
+    }
+};
diff --git a/arai60/binary-tree-zigzag-level-order-traversal/step2_deque.cpp b/arai60/binary-tree-zigzag-level-order-traversal/step2_deque.cpp
new file mode 100644
index 0000000..0a2d79e
--- /dev/null
+++ b/arai60/binary-tree-zigzag-level-order-traversal/step2_deque.cpp
@@ -0,0 +1,39 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+public:
+    vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
+        if (!root) return {};
+        vector<TreeNode*> nodes_to_visit;
+        nodes_to_visit.push_back(root);
+        vector<vector<int>> answer;
+        int level = 0;
+        while (!nodes_to_visit.empty()) {
+            deque<int> values_in_level;
+            vector<TreeNode*> nodes_in_next_level;
+            for (int i = 0; i < nodes_to_visit.size(); i++) {
+                TreeNode* node = nodes_to_visit[i];
+                if (level % 2 == 0) {
+                    values_in_level.push_back(node->val);
+                } else {
+                    values_in_level.push_front(node->val);
+                }
+                if (node->left) nodes_in_next_level.push_back(node->left);
+                if (node->right) nodes_in_next_level.push_back(node->right);
+            }
+            answer.emplace_back(values_in_level.begin(), values_in_level.end());
+            swap(nodes_to_visit, nodes_in_next_level);
+            level++;
+        }
+        return answer;
+    }
+};
diff --git a/arai60/binary-tree-zigzag-level-order-traversal/step2_zigzag_traverse.cpp b/arai60/binary-tree-zigzag-level-order-traversal/step2_zigzag_traverse.cpp
new file mode 100644
index 0000000..5c13153
--- /dev/null
+++ b/arai60/binary-tree-zigzag-level-order-traversal/step2_zigzag_traverse.cpp
@@ -0,0 +1,39 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+public:
+    vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
+        if (!root) return {};
+        vector<TreeNode*> nodes;
+        nodes.push_back(root);
+        bool left_to_right = true;
+        vector<vector<int>> answer;
+        while (!nodes.empty()) {
+            auto& values_in_level = answer.emplace_back();
+            vector<TreeNode*> nodes_in_next_level;
+            for (int i = nodes.size() - 1; i >= 0; i--) {
+                TreeNode* node = nodes[i];
+                values_in_level.push_back(node->val);
+                if (left_to_right) {
+                    if (node->left) nodes_in_next_level.push_back(node->left);
+                    if (node->right) nodes_in_next_level.push_back(node->right);
+                } else {
+                    if (node->right) nodes_in_next_level.push_back(node->right);
+                    if (node->left) nodes_in_next_level.push_back(node->left);
+                }
+            }
+            swap(nodes, nodes_in_next_level);
+            left_to_right = !left_to_right;
+        }
+        return answer;
+    }
+};
diff --git a/arai60/binary-tree-zigzag-level-order-traversal/step3.cpp b/arai60/binary-tree-zigzag-level-order-traversal/step3.cpp
new file mode 100644
index 0000000..ca692ee
--- /dev/null
+++ b/arai60/binary-tree-zigzag-level-order-traversal/step3.cpp
@@ -0,0 +1,39 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+public:
+    vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
+        if (!root) return {};
+        vector<TreeNode*> nodes;
+        nodes.push_back(root);
+        bool left_to_right = true;
+        vector<vector<int>> answer;
+        while (!nodes.empty()) {
+            auto& values_in_level = answer.emplace_back();
+            vector<TreeNode*> nodes_in_next_level;
+            for (int i = nodes.size() - 1; i >= 0; i--) {
+                TreeNode* node = nodes[i];
+                values_in_level.push_back(node->val);
+                if (left_to_right) {
+                    if (node->left) nodes_in_next_level.push_back(node->left);
+                    if (node->right) nodes_in_next_level.push_back(node->right);
+                } else {
+                    if (node->right) nodes_in_next_level.push_back(node->right);
+                    if (node->left) nodes_in_next_level.push_back(node->left);
+                }
+            }
+            nodes = move(nodes_in_next_level);
+            left_to_right = !left_to_right;
+        }
+        return answer;
+    }
+};