This document outlines several tasks involving searching and traversing data structures: implementing linear and binary search functions to search an employee array by name, implementing traversal functions for a binary search tree using in-order, pre-order and post-order, drawing a binary tree from given in-order and pre-order traversals, and additional problems of implementing binary search recursively, finding number of occurrences of a name using linear search, and finding all locations of a searched name using linear search.