» C Data Structures
C Data Structure
Here you will learn what stack data structure is, how to implement a stack using C array, linked representation and applications of stack.
provides the definition of queue data structure - one of the most common uses data structure in computer world. It also gives varies implementations of queue using array, link with source code.
provides all common linked list data structures such as: singly-linked list, doubly-linked list,singly-circularly-linked list and Doubly-circularly-linked list with clear explanation and source code in C
An AVL tree is a self-balancing binary search tree, and it is the first such data structure to be invented.
binary search tree (BST) is a node based binary tree data structure.
A binary heap is a heap data structure created using a binary tree.
A red-black tree is a special type of binary tree. A red-blank tree is used in to organize pieces of comparable data, such as numbers.