id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
iajs-350	Salih, Muna M.	Simulation Expirment for Proofing the Theoretical Assumption of Time Complexity for Binary Search Tree	2017	9	.pdf	application/pdf	2566	131	68	The package implements the sets using binary search trees. Binary search tree is a fundamental technique of programming, the advantage of using a binary search tree over an array is that a tree enable search, insertion, deletion operation to be performed efficiently [2].	cache/iajs-350.pdf	txt/iajs-350.txt