C Language + Algorithms + Data Structures = Power

learn to write a C program that reads text from standard input and prints the second five characters (indices 5-9) if length exceeds ten, using pointer arithmetic.

Count character occurrences with a 256-element array in a one-pass greedy approach, converting to lowercase and printing nonzero counts for each character.

Learn to implement a stack in C by creating a stack, using a stack node, a top pointer, and size, with push, pop, and empty checks and malloc memory.

Implement queue primitives in C by creating a queue with front and back pointers and a size, then push and pop elements, showing a constant number of operations.

Explore the tree data structure, nodes with left and right children, and binary search trees, as you insert distinct elements from root to leaves.

Learn to implement binary search tree insertion: create a tree, test emptiness, and insert elements by traversing left or right, handling duplicates, updating size.

Demonstrates a recursive print tree function that traverses left, prints the node, then right to produce in-order output; discusses pre/post/infix printing variants and tree balancing with AVL and red-black trees.

Explore how graphs model networks, from nodes and weighted edges to adjacency lists and matrices, and distinguish directed versus undirected and weighted versus unweighted graphs.

Explore recursion, where a function calls itself to solve a problem by breaking it into subproblems, illustrated by the factorial example and its recurrence relation in a simple fact program.

Examine recursion in C with level 1 order factorial and level 2 order Fibonacci. Learn how recurrence relations drive merge sort and graph traversal in data structures.

Learn how depth first search traverses a graph by marking nodes as visited, exploring each neighbor recursively, backtracking when needed, and deriving a simple dfs pseudocode with a visited array.

Implement the Dijkstra shortest path algorithm in C, using a heap-backed graph, distance and parent arrays, and path reconstruction from source to destination.

C program takes two integers and prints numbers from the first up to the second using recursion; for example 4 to 11 prints 4 through 11.

Recursively prints a string by using a char pointer in reverse, printing the current char, recursing to the next, then backtracking to the null terminator.