Data Structure
Recursive Solution 
1] N-factorial computation e.g
2] Printing string in back to front. 
3] 승수계산하기 
4] 피보나치수열 실험 예제 
5] In array A[] Binary Search 
6] Printing string in back to front 2.
7] ETC Recursion e.g 1 
8] ETC Recursion e.g 2 

Data abstraction(Implement ADTS) 
   -Header file Sphere.h for the class sphereClass 
   -Implementation file Sphere.CPP for the class sphereClass 
   -Header file ListA.h for the ADT list. 
   -Implementation file ListA.CPP for the ADT list. 

Linked List 
    -Header file ListP.h for the ADT list. 
    -Implementation file ListP.CPP for the ADT list.
   -Demonstrates SaveList and RestoreList 
   -Displays the data in a circular linked list. 

Recursive as a problem-solving technique 
1] Towers of Hanoi solution 
2] Linked list의 Recursive에의한 문자열 정/반 순서로 찍기. 
3] Linked list삽입시 정렬하면서 값삽입하기 
4] Prefix수식 계산하기 
5] Prefix 수식을 Postfix 형식으로 변환하기 

Stack 
   -Header file StackA.h for the ADT stack.
   -Implementation file StackA.CPP for the ADT stack.
   -Header file StackP.h for the ADT stack.
   -Implementation file StackP.CPP for the ADT stack.
   -Header file StackL.h for the ADT stack.
   -Implementation file StackL.CPP for the ADT stack.
   -Implementation file
   -Implementation file
   -IsPath() function : function of finding the path
 

Queues
   -Header file QueueP.h for the ADT queue.
   -Implementation file QueueP.CPP for the ADT queue.
   -Header file QueueA.h for the ADT queue.
   -Implementation file QueueA.CPP for the ADT queue.
   -Header file QueueL.h for the ADT queue.
   -Implementation file QueueL.CPP for the ADT queue.
    -Event-driven simulation of a single waiting line of people
   -Header file EL.h for ADT event list.
   -Implementation file EL.CPP for ADT event list.

 

Algorithem Efficiency & Sorting
  -Implementation file
  -Implementation file
  -Implementation file
  -Implementation file
  -Implementation file
  -Implementation file
 

Tree 
  -Implementation file
  -Header file BT.h for the ADT binary tree.
  -Implementation file BT.CPP for the ADT binary tree.
  -A Simple main 함수
  -Header file BST.h for the ADT binary search tree.
  -Implementation file BST.CPP.
 

Tables & Priority Queues 
  -Header file TableA.h for the ADT table.
  -Excerpts from the implementation file TableA.CPP.
  -Header file TableB.h for the ADT table.
  -Excerpts from the implementation file TableB.CPP.

  -Header file Heap.h for the ADT heap.
  -Implementation file Heap.CPP for the ADT heap.

  -Header file PQ.h for the ADT Priority Queue.
  -Implementation file PQ.CPP for the ADT Priority Queue.

** 이곳에 있는 Source코드는
'Data Abstraction and Problem Solving',
- "Carrano, Frank'의 책에서 인용했습니다.