SATAVAHANA UNIVERSITY - Webnode

(C) 3 & 3 (D) 8 & 3. Q.7 . In a linked list with n nodes, the time taken to insert an element after an element pointed by. some pointer is (A) 0 (1) (B) 0 (log n) (C) 0 (n) (D) 0 (n 1og n) Q.8 . What data structure would you mostly likely see in a nonrecursive implementation … ................
................