- Introduction to Data Structures
 - SINGLE LINKED LIST OPERATIONS CODING WITH EXAMPLES
 - Single linked list deletion operations
 - Double linked list insertion and create operations
 - Double Linked list deletion operations
 - stack using arrays
 - QUEUE IMPLEMENTATION USING ARRAYS
 - Stack using Single linked list
 - IMPLEMENTATION OF QUEUE USING LINKED LIST
 - HASHING TECHNIQUES(FUNCTIONS)
 - Algorithm of Evaluation of Post fix expressions along with C- program
 - Examples of post fix expression evaluation
 - Conversion of infix expression into postfix expression procedure
 - Examples of infix expression into post fix expressions
 - Procedure and example of Balanced Symbols with c program
 - Introduction to Graphs and Terminology used in graphs
 - Graphs representation
 - operations on graphs
 - Breadth First search algorithm with example
 - Depth First Search
 - Basic terminology used in trees
 - Binary tree and its representation
 - Tree traversal Techniques
 - Construct binary tree from inorder and preorder
 - Construction of binary tree from inorder and preorder in direct way
 - Construction of binary tree from postorder and inorder
 - Construction of binary tree from inorder and postorder
 - Introduction to Binary search tree and Insert operation
 - Binary search deletion with example
 - binary search tree search operation
 - AVL Trees -rotations
 - AVL Tree insertion with example
 - insertion into AVL tree
 - Deletion operation on AVL tree with example
 - Heap introduction
 - Operations of heap
 - Binomial Queues
 
Data structures
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment