compared to a sorted linked list, a balanced binary search tree offers: faster searching and slower insertion slower searching and faster insertion the same performance for searching and insertion slower searching and slower insertion faster searching and faster insertion
