数据结构
youqika
这个作者很懒,什么都没留下…
展开
-
单链表核心
void list_add(intptr_t **head, intptr_t *node){ *node = (intptr_t)*head; *head = node;}void list_remove(intptr_t **node){ intptr_t *p_del = *node; *node = (intptr_t *)**node;原创 2013-11-08 00:36:33 · 821 阅读 · 0 评论 -
后缀树不错的视频
creating the suffix tree http://www.youtube.com/watch?v=VA9m_l6LpwIusing the suffix tree http://www.youtube.com/watch?v=UrmjCSM7wDwps: 需梯子转载 2013-08-14 15:13:51 · 993 阅读 · 0 评论 -
原来我以前实现过AVL树
// avltree_frame.h: avl树实现// author: e7, ryuuzaki.uchiha@gmail.com#ifndef __AVLTREE_FRAME_H__#define __AVLTREE_FRAME_H__#include "error_info.h"#ifdef __cplusplusextern "C" {#endiftyped原创 2013-12-15 22:53:26 · 764 阅读 · 0 评论