1) Swap Adjacent Elements of Linked List.
2) In Matrix of nxn return a row which doesn't have greatest or smallest number of the matrix.. Complexity less than N.
3) Delete all black nodes of RBT which is not having red desendent.
2) In Matrix of nxn return a row which doesn't have greatest or smallest number of the matrix.. Complexity less than N.
3) Delete all black nodes of RBT which is not having red desendent.
No comments:
Post a Comment