/binary_trees

Primary LanguageC

binary_trees

This repository contains implementations of various binary tree-related tasks in C.

Table of Contents

  1. Introduction
  2. Project Structure
  3. Compilation
  4. Usage
  5. Tasks
  6. Contributing
  7. License

Introduction

Binary trees are fundamental data structures in computer science, often used for tasks like searching, sorting, and hierarchical organization. This repository includes C implementations of binary trees, covering tasks such as creating nodes, traversing trees, and implementing different types of binary trees like Binary Search Trees (BSTs), AVL Trees, and Max Binary Heaps.

Project Structure

The project structure is organized as follows:

  • 0-binary_tree_node.c: Implementation of a function to create a binary tree node.
  • binary_tree_print.c: Utility function for visualizing binary trees.
  • [Other task files]: Additional files containing implementations for various binary tree-related tasks.

Compilation

To compile the project, you can use the provided compilation command:

gcc -Wall -Wextra -Werror -pedantic binary_tree_print.c [Task files] -o binary_trees

Usage

You can use the compiled binary to run various tasks or tests:

./binary_trees

Tasks

The tasks are organized in separate files, each addressing a specific aspect of binary trees. Refer to the task files for details on the implemented functions and their purposes.

  • 0-binary_tree_node.c: Creates a binary tree node..

Contributing

Feel free to contribute to this project by submitting pull requests. If you encounter issues or have suggestions for improvements, please open an issue.

License

This project is licensed under the MIT License.

Feel free to adapt and expand this README based on your specific needs and project details.