1 votes 1 votes What is the time complexity of adding an element at the front of a circular linked list ? O(n) or theta(n) ? How to find whether it is O or theta ? Purvi Agrawal asked Oct 6, 2017 Purvi Agrawal 233 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes O(n) Becuase it will check start from head till node next--> head gorya506 answered Aug 16, 2019 gorya506 comment Share Follow See all 0 reply Please log in or register to add a comment.