Data structure (C # language description)

This article is reproduced fromAbatei has learned Data Structure many times, but he only knows the concept of hard. Now he specializes in the C # language and has a deeper understanding of the programming language,

It is a pleasure to buy a C # data structure and learn the data structure again.

Dangdang can buy it, without online banking. It can deliver the goods to the door and pay on delivery.

Purchase address:

Http://product.dangdang.com/product.aspx? Product_id = 20544747

If you have any comments or suggestions on this book, you can give an overview of the author's blog comment.

Http://cgbluesky.blog.163.com/

This is the directory of this book. In addition, we have also released a video of non-recursive Traversal Algorithms for Binary Trees. The new one is as follows:

Http://www.fileupyours.com/files/219335/5-2.swf

 

Chapter 2Introduction

1.1 What is Data Structure

1.1.1 generation and development of data structures

1.1.2 Data and Data Structure

1.1.3 logical structure of data

1.1.4 Data Storage Structure

1.2 algorithm and algorithm analysis

1.1.5 Algorithm

1.1.6 objectives of Algorithm Design

1.1.7 time complexity of the algorithm

1.1.8 spatial complexity of the algorithm

1.3 summary of this Chapter

1.4 exercise

 

Chapter 2Linear table

2.1 linear table definition

2.2 ordered storage structure of linear tables-ordered tables

2.2.1 features of ordered tables

2.2.2 Array

Video 2-1

2.2.3 analyze system. Collections. arraylist

Video 2-2

2.2.4 type security

2.3 chain storage structure of linear tables-linked list

2.3.1 unidirectional linked list

Video 2-3

2.3.2 cyclic linked list

Video 2-4

2.3.3 bidirectional linked list

Video 2-5

2.4 Summary of this Chapter

2.5 Practical Training Guide: Virtual linear table

Video 2-6

2.6 exercise

 

3rdChapterStack and queue

Stack 3.1

3.1.1 stack concepts and operations

3.1.2 analyze system. Collections. Stack

Video 3-1

3.1.3 stack applications

Video 3-2

3.1.4 bidirectional Stack

3.2 queue

3.2.1 concepts and operations of queues

3.2.2 cyclic queue

3.2.3 analyze system. Collections. Queue

Video 3-3

3.3 summary of this Chapter

3.4 Practical Training Guide: Virtual cyclic queue

Video 3-4

3.5 exercise

 

4thChapterString

Basic concepts of 4.1 strings

4.2 string

4.3 system. Text. stringbuilder

4.4 string pattern matching

4.4.1 brute-force Algorithm

Video 4-1

4.4.2 KMP Algorithm

Video 4-2

Video 4-3

4.5 summary of this Chapter

4.6 Practical Training Guide: seek the longest public substring

Video 4-4

4.7 exercise

 

5thChapterTree

Basic concepts of tree 5.1

5.1.1 tree Definition

5.1.2 Tree Representation

5.1.3 basic terms of the tree

5.2 Binary Tree

5.2.1 basic concepts of Binary Trees

5.2.2 Binary Tree Storage Structure

5.3 binary tree traversal

5.3.1 Binary Tree depth-first Traversal

Video 5-1

5.3.2 Binary Tree breadth-first Traversal

Video 5-2

5.4 clue Binary Tree

5.4.1 clue Binary Tree Definition

5.4.2 ordinal clue Binary Tree

Video 5-3

5.5 trees and forests

5.5.1 tree storage structure

5.5.2 mutual conversion of forests, trees, and Binary Trees

Video 5-4

5.6 design of a tree that can be drawn

5.6.1 location relationship of a binary tree node

5.6.2 Interface Design

5.6.3 Design of Binary Tree rendering class

5.6.4 implement the ability to draw Binary Trees

5.7 Binary Tree Algorithm

5.7.1 full Binary Tree painting

Video 5-5

5.7.2 internal painting

5.7.3 minimum area

5.8 summary of this Chapter

5.9 Practical Training Guide: Virtual Binary Tree

Video 5-6

5.10 exercise

 

6thChapterFigure

6.1 basic concepts and terms

6.2 Storage Structure

6.2.1 adjacent matrix representation

6.2.2 adjacent table Representation

6.3 graph Traversal

6.3.1 deep Priority Search Traversal

6.3.2 breadth-first search Traversal

6.3.3 traversal of a non-Connected Graph

6.4 Spanning Tree and least Spanning Tree

6.4.1 Spanning Tree

6.4.2 minimal spanning tree

6.4.3 prim algorithm

Video 6-1

6.4.4 cruise Card Algorithm

Video 6-2

6.5 Shortest Path

6.5.1 shortest path of a single source node

Video 6-3

6.5.2 shortest path between all vertices

Video 6-4

6.6 Summary of this Chapter

6.7 practical training guidance: Labyrinth Shortest Path Problems

Video 6-5

6.8 exercise

 

7thChapterSearch

7.1 Basic Search concepts

7.2 sequential Lookup

7.3 Binary Search

7.3.1 basic principles of Binary Search

Video 7-1

7.3.2 Binary Search Algorithm Implementation

7.3.3 array. binarysearch Method

7.3.4 analyze system. Collections. sortedlist

7.4 multipart search

Video 7-2

7.5 Binary Search Tree

7.5.1 Binary Search Tree Definition

Video 7-3

7.5.2 binary search tree search

7.5.3 insert a binary search tree

7.5.4 Delete A Binary Search Tree

7.5.5 code implementation of the Binary Search Tree

7.6 Summary of this Chapter

7.7 Practical Training Guide: Use of array. binarysearch

7.8 exercise

 

Chapter 2Hash table

8.1 Introduction of concepts

8.2 construct a hash function

8.2.1 direct addressing

8.2.2 Digital Analysis

8.2.3 except the remaining remainder

8.3 hash conflict solution

8.3.1 closed Hash (open address)

8.3.2 split-Hash (link address)

8.4 analyze system. Collections. hashtable

Video 8-1

8.4.1 implementation principle of hashtable

8.4.2 hashtable code implementation

8.5 analyze dictionary <tkey, tvalue>

Video 8-2

8.5.1 dictionary <tkey, tvalue> class implementation principle

8.5.2 code implementation of dictionary <tkey, tvalue>

8.6 summary of this Chapter

8.7 Practical Training Guide: Virtual hash table

Video 8-3

8.8 exercise

 

Chapter 2Sort

9.1 basic concepts of sorting

9.2 insert sorting

9.2.1 direct insertion sorting

Video 9-1

9.2.2 Hill sorting

Video 9-2

9.3 exchange sorting

9.3.1 Bubble Sorting

Video 9-3

9.3.2 quick sorting

Video 9-4

9.4 select sorting

9.4.1 directly select sorting

Video 9-5

9.4.2 heap sorting

Video 9-6

9.5 Merge Sorting

Video 9-7

9.5.1 two-way Merge Sorting

9.5.2 implementation of two-way Merge Sorting

9.6 summary of this Chapter

9.7 Practical Training Guide: Use the icomparer <t> API for sorting

Video 9-8

9.8 exercise

 

Chapter 4 comprehensive training-Eight Digital Problems

10.1 what is Octa digital

Analysis of 10.2 digital Problems

Video 10-1

10.2.1 whether there is a solution from the initial status to the target status

10.2.2 method used to solve the optimal solution of the eight decoding problem

10.2.3 how to avoid repeated access to a status

10.2.4 how to record the search path

10.2.5 what data structure is used to indicate the Board status

10.3 design objectives

10.4 Interface Design

Video 10-2

10.5 code writing

Video 10-3

10.5.1 movedirection. CS

10.5.2 airesult. CS

10.5.3 hashhelpers. CS

10.5.4 simpledictionary. CS

10.5.5 numswitch. CS

10.5.6 ieightnumai. CS

10.5.7 bfs_ai.cs

10.5.8 mainform. CS

10.6 debug and run

10.7 thoughts and Improvements

Data structure (C # language description)