Please enable JavaScript.

Coggle requires JavaScript to display documents.

1.4.2 data structures (linked list (traversing (set pointer to start,…

- - - - if data x is first item just remove it and update starting pointer- update free pointer
- - - - use stacks
      - start at route follow one branch as far as possible
      - How too do
        
        push the first item on to stack and mark as visted
        
        visit next unvisited vertex mark as visited and push on to stack
        
        if there is nor more vertexes to visit pop from stack
        
        repeat until stack is empty
      - may never find soultion
      - can be done using concurence
    - - use ques
      - go to all nodes connected to nodes and scan left to right
      - how to do
        
        push the first vertex onto the queue and mark as visted
        
        visit all unvisited vertexes connected to fist vertex mark as visited and push on to que
        
        repeat
        
        pop next vertex from que
        
        repeat
        
        visit all vertexes connected to current
        
        push on the que
        
        until all vertexes are visted
        
        until queis empty
- - - - check for next available space
      - this causes clustering- increasing likerly hood
      - overflow linked lists ar e used to store multiple data in one key
- - - - lists that cant be edited- immuable
      - fixed size
    - - can be edited
      - dynamic
      - can change size
      - mutable
      - can use an index
- - - - if tree is empty enter data at route and stop
      - current node =root
      - repeat
      - if new data item is less then value go left else go right
      - current node = node reached
      - until node = null
      - create new node and enter data
    - - pre order
        
        visit root
        
        top down
        
        traverse left sub tree
        
        travsere right sub tree
      - in order
        
        retrived in sequance
        
        transverse left
        
        visit root
        
        traverse right
      - post order
        
        bottum up
        
        traverse left
        
        traverse right
        
        visit route
        
        gets things in reverse polish notation
- - - - check to see if the stack is full - if so report an error
      - increment stack pointer
      - insert new data item at new location
    - - check ifstack is emty - report error
      - decrement stack pointer
  - - - check to see if full
      - if full report error
      - insert new data item into location pointed to by pointer
      - increment pointer
    - - check to see if empty
      - copy data item in location pointed to by tail pointer
      - increment tail pointer