# C DATA STRUCTURES

# Memory Allocation

# Linked-List

# Add a node

There are four steps to add a node to a linked list:

1. Allocate memory for the new node.
2. Determine the insertion point
3. Point the new node to its successor
4. Point the predecessor to the new node.

# Delete a node

# Search for a node

# Traverse (walk) the list

# Examples

# Doubly Linked List

# Adding Nodes

# Find a Node by ID

# Stacks

# Push

# Pop

# Queues

# enqueue

# dequeue

# Binary Tree

# Breadth-First Traversal

# Depth-First Traversal

# Preorder

# Inorder

# Postorder