aisd/Lab2/bst/bst.cpp

#include "bst.h"

Tree *insert(Tree *root, int value) {
  if (root == nullptr) {
    root = new Tree{value, nullptr, nullptr};
  } else if (value < root->info) {
    root->left = insert(root->left, value);
  } else if (value > root->info) {
    root->right = insert(root->right, value);
  }
  return root;
}

Tree *search(Tree *root, int value) {
  Tree *ptr = root;
  while (ptr != nullptr) {
    if (value > ptr->info)
      ptr = ptr->right;
    else if (value < ptr->info)
      ptr = ptr->left;
    else
      return ptr;
  }
  return nullptr;
}

void deleteTree(Tree *root) {
  if (root != nullptr) {
    deleteTree(root->left);
    deleteTree(root->right);
    delete root;
  }
}

int getHeight(Tree *root, int height) {
  if (root == nullptr)
    return height;
  height += 1;
  int leftHeight = getHeight(root->left, height);
  int rightHeight = getHeight(root->right, height);
  return std::max(leftHeight, rightHeight) + 1;
}