随笔分类 - Datastructure
数据结构和算法的学习笔记
摘要:In computer science, a doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the sequence of nodes. The beginning and ending nodes'
阅读全文
摘要:Singly linked lists contain nodes which have a data field as well as anextfield, which points to the next node in the linked list. --fromwikipedia(http://en.wikipedia.org/wiki/Linked_list)链表中的节点Node,包含一个数据域和一个指针域,指向下一个链表结点。链表的结点包含二个域:1)数据域,当前结点的值2)指针域,指向下一个结点在链表中,因为要涉及到插...
阅读全文
摘要:In computer science, a stack is a last in, first out (LIFO) abstract data type and linear data structure. A stack can have any abstract data type as an element, but is characterized by only three fundamental operations: push, popand stack top. The push operation adds a new item to the top of the sta
阅读全文
摘要:最近在当当上买了《FUNDAMENTALS OF DATA STRUCTURES IN C》,在上班之余看看,会不定时发布自己的课后习题解答!一定要坚持哦~~
阅读全文
浙公网安备 33010602011771号