From 7c5cc28ba299b15acc258bf4c7aca0258eae1d2f Mon Sep 17 00:00:00 2001
From: Christian Clauss <cclauss@me.com>
Date: Thu, 15 Oct 2020 13:20:43 +0200
Subject: [PATCH] Revert recent changes to .pre-commit-config.yaml (#3318)

* Revert recent changes to .pre-commit-config.yaml

We must continue to insist that algorithmic functions can not print() as discussed in CONTRIBUTING.md.

* updating DIRECTORY.md

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
---
 .pre-commit-config.yaml | 16 +++++-----------
 DIRECTORY.md            |  5 +++++
 2 files changed, 10 insertions(+), 11 deletions(-)

diff --git a/.pre-commit-config.yaml b/.pre-commit-config.yaml
index 40d90741f..01da6cad0 100644
--- a/.pre-commit-config.yaml
+++ b/.pre-commit-config.yaml
@@ -6,22 +6,16 @@ repos:
       - id: check-yaml
       - id: end-of-file-fixer
         types: [python]
-      # Some doctests use print(x, sep=" ") and black will not fix inside triple quotes
-      # It is too confusing for new contributors to understand this and how to fix
-      #- id: trailing-whitespace
-      #  exclude: |
-      #    (?x)^(
-      #      data_structures/heap/binomial_heap.py
-      #    )$
+      - id: trailing-whitespace
+        exclude: |
+          (?x)^(
+            data_structures/heap/binomial_heap.py
+          )$
       - id: requirements-txt-fixer
   - repo: https://github.com/psf/black
     rev: stable
     hooks:
       - id: black
-    exclude: |
-      (?x)^(
-        data_structures/binary_tree/binary_tree_traversals.py
-      )$
   - repo: https://github.com/PyCQA/isort
     rev: 5.5.3
     hooks:
diff --git a/DIRECTORY.md b/DIRECTORY.md
index fe6b604cb..d2ce99e71 100644
--- a/DIRECTORY.md
+++ b/DIRECTORY.md
@@ -107,6 +107,7 @@
     * [Binary Search Tree](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/binary_search_tree.py)
     * [Binary Search Tree Recursive](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/binary_search_tree_recursive.py)
     * [Binary Tree Mirror](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/binary_tree_mirror.py)
+    * [Binary Tree Traversals](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/binary_tree_traversals.py)
     * [Fenwick Tree](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/fenwick_tree.py)
     * [Lazy Segment Tree](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/lazy_segment_tree.py)
     * [Lowest Common Ancestor](https://github.com/TheAlgorithms/Python/blob/master/data_structures/binary_tree/lowest_common_ancestor.py)
@@ -675,12 +676,16 @@
     * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_099/sol1.py)
   * Problem 112
     * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_112/sol1.py)
+  * Problem 113
+    * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_113/sol1.py)
   * Problem 119
     * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_119/sol1.py)
   * Problem 120
     * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_120/sol1.py)
   * Problem 125
     * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_125/sol1.py)
+  * Problem 173
+    * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_173/sol1.py)
   * Problem 191
     * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_191/sol1.py)
   * Problem 234