Data Strucrures



  Template for SLL   Singly Linked List   Stack Using Linked List   Operations on Linked List   Queue Using Linked List   Double Linked List   Polynomial using Linked List   Generalize Linked List
  Tree Terminologies   Binary Tree   Binary Tree Traversals   Binary Search Tree Traversals   Binary Search Tree Operations
  Introduction   Graph Traversals   Minimum Spanning Tree   Graph Representation
  Hash Table Operations


Generalize Linked List

   Linear Search and Binary Search PPT
Prev Post

Definition:

  A generalized linked list ‘A’ is a finite sequence of ‘n’ elements,(a1,a2,a3….. an), where ‘ai’ may be either atom or a list. The element which are not atoms are called sub list of A.

  - if all elements are atoms, then it is a simple list

  - The node structure of GLL is

e.g.

  1. A = (a, (b, c))
  2. B = (A,A, d, e )
  3. C = (a, (b, c ), (p, q, r))
  4. D = ( ( d, e), ( e, f ), c )
  5. E = ( 1, 2, (3, (4, 5)),6)

Polynomial Representation Using GLL:

  1.  5x6 + 9x2 + 3x + 7
  2.   y3 ( 5x2 + 9x) + y ( 5x + 6) + ( 9x3 + 7 )
  3.   x10 y3 z2 + 2x8 y3 z2 + 3x8 y2 z2 + x4 y4 z + 6x3 y4 z + 2yz

Examples of GLL:

1.  A = (a, (b, c))