What is the complexity of finding the predecessor of a node in a doubly linked list?
Both answers look wrong. Time is indeed $O(1)$ because you can look into prev (not next) pointer of the node. The answers you found on the web are probably about single-linked lists.