简介
本项目将介绍常见的线性、树形、图状数据结构，并使用Python等进行实现。
在开始阅读本项目之前，请先阅读基本概念。
额外说明
- 对于树的遍历等操作，通常有递归和非递归两种实现，有时非递归实现非常难理解，所以博主总结出一套通过模拟栈和桢，消除递归的方式，更多细节请查看这篇文档
- 在开始阅读本项目之前，最好对下面列出的五种常用算法有一定的了解：
tim-chow/DataStructure
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
master
Could not load branches
Nothing to show
Could not load tags
Nothing to show
{{ refName }}
default
Name already in use
A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
Code
-
Clone
Use Git or checkout with SVN using the web URL.
Work fast with our official CLI. Learn more about the CLI.
- Open with GitHub Desktop
- Download ZIP
Sign In Required
Please sign in to use Codespaces.
Launching GitHub Desktop
If nothing happens, download GitHub Desktop and try again.
Launching GitHub Desktop
If nothing happens, download GitHub Desktop and try again.
Launching Xcode
If nothing happens, download Xcode and try again.
Launching Visual Studio Code
Your codespace will open once ready.
There was a problem preparing your codespace, please try again.
About
DataStructure & Algorithm
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published