how can i prove that T(n)=T(n-2)+T(n-3)+T(n-4)+2 is O(logn)? or T(n)=T(n-1)+T(n-3)+1 the same.. when T(0)=1 T(1)=2 T(2)=3 T(3)=5 T(4)=8 etc`..
it's a Q about AVL-2 tree,the same rules of AVL tree who rotate after 3 levels diff between L,R childs.. and not 2 as AVL tree
thanks for all.
