Add two test cases to verify the operations of accessing head,tail,insert and remove in constant time by proving the time complexity of the operations are O(1). Signed-off-by: Ningx Zhao <ningx.zhao@intel.com>