In an AVL tree, at what condition the balancing is to be done? proper code in c languge
Posted
by bachchan
on Stack Overflow
See other posts from Stack Overflow
or by bachchan
Published on 2010-05-14T10:50:00Z
Indexed on
2010/05/14
10:54 UTC
Read the original article
Hit count: 179
Filed under:
c
Binary search follows Divide and Conquer method where as linear Search doesn't follw.The time complexity of Binary Search in O(log n) but incase of linear search the time complexity is O(n). Thats way Binary search is having bettr prior than linear search. But it is true when the list of items is large incase of smaller list linear is best(i.e.- it is only when the Best Case concern)
© Stack Overflow or respective owner
