# data_struct

**Repository Path**: lclei/data_struct

## Basic Information

- **Project Name**: data_struct
- **Description**: 数据结构展示
- **Primary Language**: Unknown
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2021-01-17
- **Last Updated**: 2021-06-06

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# data struct

These containers is now completed.
- list
- stack
- queue
- binary tree
- hash table

List, stack, queue is based on linked list. Actually list is implued as a deque. Then stack and queue are variants of list.
Binary tree has pre, post, in and level order traverse.
Hashtable is a array of list. When hashcode conflict, just link to the bucket list tail.

The data of these container is type void * for gernaral use.

See test.c for example.

Excute test:
1. make
2. ./test