I need to make a simple C++ program that does the following:

using any of the following ADTs and/or any C++ STL classes:

- Linked Lists

- Heaps

- Stacks / Queues / Dequeues

- Trees (Binary / 2-4 / Red-Black)

Given: Two lists of integers L1 and L2; - the input pair of lists will be in the form of a single text file, which you will read from standard input. In the file, each list consists of a sequence of positive integers, one integer per line, with a line containing a 0 delimiting the two lists (e.g. 234543203434) - reads data and stores in dynamic data structure (NOT reading size of data file before reading it to create a large enough array or using an arbitrarily large array that is intended to be large enough for largest test set) Output: The largest number that occurs in L1 but does not occur in L2, or "NONE" if there is no such number. 

- e.g. inputting a text file containing "123450" will output "5"

- e.g. inputting a text file containing "0123456" will output "NONE"