question about DS the stack

can you explain how the stack is connected to the backtracking algorithms(maze, file directories) and calling functions(call stack) everything inside () was given as an example I probably may get it from FD but not sure. Also they talked about browser history and undo/redo the ctrl z as the stack is this just an example of the idea but not really has nothing to do with programing right ? same with the stack of books just to give an idea but nothin