From 1ca2c9e9702f97e878ed51ecea8f1403e7e67403 Mon Sep 17 00:00:00 2001
From: Martin Skachkov <mgsemailbox@gmail.com>
Date: Sun, 4 Dec 2022 09:14:45 +0200
Subject: changes

---
 Seminar08/inorder-traversal.cpp |  2 +-
 Seminar08/min-max-elem.cpp      | 16 ++++++++--------
 2 files changed, 9 insertions(+), 9 deletions(-)

diff --git a/Seminar08/inorder-traversal.cpp b/Seminar08/inorder-traversal.cpp
index 7c7fb73..c9a9bd6 100644
--- a/Seminar08/inorder-traversal.cpp
+++ b/Seminar08/inorder-traversal.cpp
@@ -1,7 +1,7 @@
 #include "tree-utils.h"
 
 template <typename T>
-void inorderTraversal(Tree<T> *tree) {
+void inorderTraversal(const Tree<T> *tree) {
     if (tree == nullptr) {
         return;
     }
diff --git a/Seminar08/min-max-elem.cpp b/Seminar08/min-max-elem.cpp
index 2de8543..cbd8560 100644
--- a/Seminar08/min-max-elem.cpp
+++ b/Seminar08/min-max-elem.cpp
@@ -3,8 +3,8 @@
 
 // for regular binary trees
 template <typename T>
-int max_elem(Tree<T> *tree) {
-    int res = tree->data;
+T max_elem(Tree<T> *tree) {
+    T res = tree->data;
 
     if (tree->left != nullptr) {
         res = std::max(res, max_elem(tree->left));
@@ -17,8 +17,8 @@ int max_elem(Tree<T> *tree) {
 }
 
 template <typename T>
-int min_elem(Tree<T> *tree) {
-    int res = tree->data;
+T min_elem(Tree<T> *tree) {
+    T res = tree->data;
 
     if (tree->left != nullptr) {
         res = std::min(res, min_elem(tree->left));
@@ -32,16 +32,16 @@ int min_elem(Tree<T> *tree) {
 
 // for binary search trees
 template <typename T>
-int max_elem_bst(Tree<T> *tree) {
-    while (tree->right != NULL)
+T max_elem_bst(Tree<T> *tree) {
+    while (tree->right != nullptr)
         tree = tree->right;
 
     return tree->data;
 }
 
 template <typename T>
-int min_elem_bst(Tree<T> *tree) {
-    while (tree->left != NULL)
+T min_elem_bst(Tree<T> *tree) {
+    while (tree->left != nullptr)
         tree = tree->left;
 
     return tree->data;
-- 
cgit v1.3.1-23-gd82d