Expressions

输入N个点的坐标，判断这N个点能否构成一个凸多边形。(Enter the coordinates of N points, to determine whether the N points form a convex polygon.)

有向图的邻接表存储的实现，包括有向图的各种操作(Directed graph adjacency list storage implementation, including a variety of operations to the map)

C语言树的简单实现,介绍了树你前序遍历，树插入与删除节点的实现(C-tree is simple to achieve, before you introduced the tree traversal, tree insert and delete nodes to achieve)

数据结构相关代码，源码-数据结构算法解析(高一凡 )(Data structure-related code, source code- Data Structure Analysis algorithm (high one where))

说明：  简单的数据结构算法 在POJ上的题目 利用C++实现(Simple data structure algorithm in POJ on the subject using C++ Implementation)

提供字符串方法，大家面试可以用，包括找出对称字串(Some string function)

二叉树的设计。包含二叉树结点类的设计以及二叉树的遍历。(Binary tree design. Contains the binary tree node class design, and Binary Tree Traversal.)

几个比较好的初级算法，初学者可以看一下思想，对算法入门(A few good elementary algorithms, beginners can look at thinking on algorithms entry)

线性表的链接实现可利用单链表来实现，每个节点存储一个元素。 利用单链表来实现线性表的元素的插入，删除，修改等功能。 (Linear link table can be used to achieve a single linked list to implement, each node stores an element. Using a single linked list to implement elements of the linear table insert, delete, modify, and other functions.)

对元素类型为整型的顺序存储的线性表进行插入、删除和查找操作(C++)。(C integer linear sequence of stored data table insert, delete and search operations)