Does anyone have a link where i can printout the running time of operations on different data structures. eg. inserting into an AVL tree worst case 0(log N) avg. case 0 (log N) insert into a BST worst case 0(N) avg case 0(log N) THX