A C program for Binary Search Tree (BST) operations.

Development of codes for wireless sensor networks. This work works on concepts of nodes, n-ary tree, linked lists and detection of parent-child nodes.

Example of node incidence matrix where we keep the highest amount of nodes that are not connected by edges. (Algorithms 2021)

This is a c project in which the user enters an amount of students that will be inserted in a list. The user enters the ID of each student and their final grade. After each insertion the list will be displayed with its contents. The user also has the option to delete an entry.

This is a c project in which the user enters an amount of numbers (>2) and then these numbers get inserted in a Binary Search Tree (BST). After all the insertions, the user enters a number and the program displays in the console the ceiling and the floor of that number.

This project was my final project last semester in my CS2 class to conclude our review of data structures using C. I was put into a group of 3 other students and we went on campus downtown to record data of the streets we decided to include in our Queue

This is a c project, in which the user inserts an amount of numbers(between 1-20) and the chose wither to see the ascending order or the descending order. The program solves the problem with the use of nodes and a list.

Tool based in nodes to build GLSL shaders without any programming knowledge written in C using OpenGL and GLFW.