From 20587750051c3699b051579d7e97e5508958ea5a Mon Sep 17 00:00:00 2001
From: Caeden <caedenperelliharris@gmail.com>
Date: Fri, 14 Oct 2022 23:25:15 +0100
Subject: [PATCH] refactor: Make code more understandable (#7196)

* refactor: Make code more understandable

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
---
 .../binary_tree/binary_tree_traversals.py         | 15 ++++++++++++++-
 1 file changed, 14 insertions(+), 1 deletion(-)

diff --git a/data_structures/binary_tree/binary_tree_traversals.py b/data_structures/binary_tree/binary_tree_traversals.py
index 378598bb0..54b1dc536 100644
--- a/data_structures/binary_tree/binary_tree_traversals.py
+++ b/data_structures/binary_tree/binary_tree_traversals.py
@@ -15,7 +15,20 @@ class Node:
 
 
 def make_tree() -> Node | None:
-    return Node(1, Node(2, Node(4), Node(5)), Node(3))
+    r"""
+    The below tree
+        1
+       / \
+      2   3
+     / \
+    4   5
+    """
+    tree = Node(1)
+    tree.left = Node(2)
+    tree.right = Node(3)
+    tree.left.left = Node(4)
+    tree.left.right = Node(5)
+    return tree
 
 
 def preorder(root: Node | None) -> list[int]: