Description: 1.sort:quicksort select sort,insert sort,heap sort.etc.
2.graph:create with the adjacent list,and traverse in DFS
3.binarytree:create the tree,insert a node,or delete one
4.binary searchtree:create the tree,insert one ,find one ,or delete one
5.address list:have an interface,you can add,find or delete
To Search:
File list (Check if you may need any files):
addresslist\dictionary.h
...........\hash.h
...........\list.h
...........\main.cpp
...........\string.h
...........\vector.h
sort.cpp
binarysearchtree.cpp
binarytree.cpp
graph.cpp
addresslist
Download