From a8192d370fefa245a38a0419d25c61eeaf26daac Mon Sep 17 00:00:00 2001
From: Dawid <dawid.malecki21@gmail.com>
Date: Wed, 22 May 2024 17:04:48 +0200
Subject: [PATCH] formatted

---
 src/data_structures/segment_tree.rs | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/data_structures/segment_tree.rs b/src/data_structures/segment_tree.rs
index 9884683..ce5dff0 100644
--- a/src/data_structures/segment_tree.rs
+++ b/src/data_structures/segment_tree.rs
@@ -1,8 +1,8 @@
 use std::cmp::{max, min};
 
 /// Segment Tree
-/// O(log n) time complexity for range queries and updates. 
-/// The segment tree is a binary tree that stores the range of values in an array. 
+/// O(log n) time complexity for range queries and updates.
+/// The segment tree is a binary tree that stores the range of values in an array.
 /// The root of the tree stores the range of values from 0 to n-1
 pub struct SegmentTree<T: PartialEq + Copy> {
     n: usize,