Scribd Logo
Upload

Welcome to Scribd!

  • Assign Non Pri Data Structures

    Uploaded by

    ALLIAH CARRIE FERRER
    8 views3 pages
    Queue, stack, hash table, graph, tree, and heap are common data structures. A queue follows FIFO order, a stack follows LIFO order, a hash table maps keys to array indices using a hash function, a graph connects vertices with edges, a tree has a root node and branches out in parent-child relationships, and a heap is a complete binary tree that organizes data to always keep the minimum or maximum value at the top.

    Original Description:

    Original Title

    assign non pri data structures

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Queue, stack, hash table, graph, tree, and heap are common data structures. A queue follows FIFO order, a stack follows LIFO order, a hash table maps keys to array indices using a hash function, a graph connects vertices with edges, a tree has a root node and branches out in parent-child relationships, and a heap is a complete binary tree that organizes data to always keep the minimum or maximum value at the top.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views3 pages

    Assign Non Pri Data Structures

    Uploaded by

    ALLIAH CARRIE FERRER
    Queue, stack, hash table, graph, tree, and heap are common data structures. A queue follows FIFO order, a stack follows LIFO order, a hash table maps keys to array indices using a hash function, a graph connects vertices with edges, a tree has a root node and branches out in parent-child relationships, and a heap is a complete binary tree that organizes data to always keep the minimum or maximum value at the top.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

     Queue – A queue is defined as a linear data structure that is open at both ends and the

    operations are performed in First In First Out (FIFO) order.

     Stack is a linear data structure which follows a particular order in which the
    operations are performed. The order may be LIFO(Last In First Out) or FILO(First
    In Last Out).

    Hashtable This
    data structure takes a value, computes the value into
    a key through a hash function, and maps the key into an index in
    an array.

     Graph is a non-linear data structure composed of vertices/nodes and edges/lines


    that connect them.

     Tree is a graph data structure that has a start (root) and branched out from there.
    There is a clear parent child relation between the vertices. They are arranged on
    multiple levels or we can say it is a hierarchical structure. 
     A Heap is a special Tree-based data structure in which the tree is a complete
    binary tree. Min-Heap and Max-heap are two types of Heap.

    You might also like