An overview of my work at 42 Silicon Valley's Piscine on C, including a topic overview and an explanation of the grading system.

Using graphviz to enable visualization on linked-list implementation.

Hoffman and O'Donnel's "Pattern matching in trees" implemented in C

Data Structure & Algorithms workshop training organised by E&ICT training cell, where learned the basics of data structure and algorithms during my 45 days training programme.

Solutions to 42's intermediate-level exams

In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. ... This project is all about training oneself to work on various binary tree possibilities (creation of a root node/left-child/right-child, deletion and more over.)

All About Tree

Two programs that illustrate the creation of OEIS array A089840, which lists signature permutations of non-recursive Catalan automorphisms, that is, bijections of finite plane binary trees, with no unlimited recursion down to indefinite distances from the root.

Map a binary tree to a list (c version of mafintosh/flat-tree)

To create binary tree, perform search on tree ,print data,delete a node on tree.

C Binary Trees

Yet another red-black tree implementation

Subdirectories inside focus on C, Algorithms, and Data Structures. 98%+ of the code inside is written in C.

Code created using C language to solve mathematical expressions using PILE data structure through Binary Trees

Binary Search Trees, Splay Trees and Red Black Trees implemented in C

Encode&Decode Morse Code

Data Structures and Algorithms, you'll find comprehensive notes, explanations, and implementations of various data structures and algorithms.

Foundations - Low-level programming & Algorithm ― Data structures and Algorithms

My journey as a July 2019 pisciner and September 2019 cadet.

A collection of binary tree data structures and algorithms implemented in C. It provides a variety of functions for creating, manipulating, and traversing binary trees efficiently.