Optical improvements of the datastructures section.

1 files changed, 1 insertions, 1 deletions

diff --git a/datastructures/stlTree.cpp b/datastructures/stlTree.cpp
index 73472a7..bdbeae3 100644
--- a/datastructures/stlTree.cpp
+++ b/datastructures/stlTree.cpp
@@ -7,6 +7,6 @@ int main() {
 	Tree X;
 	for (int i = 1; i <= 16; i <<= 1) X.insert(i); // {1, 2, 4, 8, 16}
 	cout << *X.find_by_order(3) << endl; // => 8
-	cout << X.order_of_key(10) << endl; // => 4 = successor of 10 = min i such that X[i] >= 10
+	cout << X.order_of_key(10) << endl; // => 4 = Nachfolger von 10 = minimales i, sodass X[i] >= 10
 	return 0;
 }
\ No newline at end of file