2c03-review - 00057

2c03-review - 00057 - insertion: n(n + 1) = O(n 2 ) 2 i =1...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
2 insertion: 2 1 (1 ) () 2 n i nn iO n = + == inorder walk takes On therefore total time: 2 Best case: (l g) On n : when tree growth is balanced, each insertion takes (lg ) ,we have
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.
Ask a homework question - tutors are online