Professional Documents
Culture Documents
Balanced Tree Testing
Balanced Tree Testing
return minimum{mindepth(p->left)+1,mindepth(p->right)+1};
return maximum{maxdepth(p->left)+1,maxdepth(p->right)+1};
if(maxdepth(p)-mindepth(p)>1)
else
print"tree is balanced";
complexity =o(n)