easy c++ solution || using double linked list
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nstruct Node {\n    string val;\n    Node* prev=NULL;\n    Node* next=NULL;\n};\nclass BrowserHistory {\npublic:\nNode* curr=NULL;\n    BrowserHistory(string homepage) {\n        curr=new Node();\n        curr->val=homepage;\n    }\n    \n    void visit(string url) {\n        Node* temp=new Node();\n        temp->val=url;\n        curr->next=temp;\n        temp->prev=curr;\n        curr=temp;\n    }\n    \n    string back(int steps) {\n        while(curr->prev && steps>0)\n        {\n            curr=curr->prev;\n            steps--;\n        }\n        return curr->val;\n        \n    }\n    \n    string forward(int steps) {\n       while(curr->next&& steps>0)\n       {\n           curr=curr->next;\n           steps--;\n       } \n       return curr->val;\n    }\n};\n\n/**\n * Your BrowserHistory object will be instantiated and called as such:\n * BrowserHistory* obj = new BrowserHistory(homepage);\n * obj->visit(url);\n * string param_2 = obj->back(steps);\n * string param_3 = obj->forward(steps);\n */\n```
['Doubly-Linked List', 'C++']