Data Structures and Algorithms Online Test

For the following pseudocode functions, choose the big O notation that accurately describes its worst-case complexity.

The following pseudocode functions will be used for managing student data using a Hashtable:

function addStudent(table : Hashtable, id : int, name : string) : void
  table.add(id, name)
end function

function findStudentIdByName(table : Hashtable, name : string) : int?
  loop (for each entry in table)
    if entry.value == name
      return entry.key
    end if
  end loop

  return null
end function

What can be correctly said about the pseudocode?

The function below is used to search for an element in a binary tree that contains linked nodes.

function treeContains(treeNode : Node, element : int) : bool
  if (treeNode == NULL)
    return false
  else if (treeNode.getValue() == element)
    return true
  else 
    left : bool = treeContains(treeNode.getLeft(), element)
    right : bool = treeContains(treeNode.getRight(), element) 
    return left || right 
  end if
end function

What can be said about the treeContains function?

Answer the questions below regarding correct usage of data structures.