write a function that takes a pointer to the top of a stack and creates and returns a new stack double where the new stack contains all nodes from the original stack with data == 0 c++

1. A company wants to evaluate employee records in order to lay off some workers on the basis of service time (the most recently hired employees are laid off first). Only the employee ids are stored in stack. Write a program using stack and implement the following functions: Main program should ask the appropriate option from the user, until user selects an option for exiting the program. Enter_company (emp_id)- the accepted employee id(integer) is pushed into stack. Exit_company ()- The recently joined employee will be laid off from the company Show employee ()- display all the employees working in the company. count()- displays the number of employees working in the company. i) ii) iii) iv)

I need help with this C++ question  Given an empty stack, the following operations are performed in the following sequence:push 5push 7poppush 10push 5pop Which of the followings are the contents of the stack after the operations are performed?

5. fast please  Convert the following infix expression into its prefix and postfix equivalents: a / b - (c + d * e) / f * g For any postfix, show the final transformed expression using the stack method for transformation as explained in class showing all the relevant steps. For the prefix, show any needed reversion and the final transformed expression using the stack method for transformation as explained in class showing all the relevant steps. Draw and sequence your diagrams clearly

Using C, Must be in C   Create a menu driven program that performs the following tasks (each task is a menu item):                            a. Create a doubly linked list of length 5 using dynamic allocation. Your linked-list should support method Write a function on to print the content of the linked list following its order. Write a function on to reverse the doubly linked list.  Write a function to Delete the first node in your doubly Linked list

f) Write a C++ function to insert all the elements of the vector into a stack and return the stack from the function. stack vector_to_stack(vectorv){ //write your code here }

Write a C++ code that will join the doubly linked list pointed to by blist at the end of the doubly linked list pointed to by alist. The new doubly linked list will have the header node pointed to by the pointer variable xlist. (Each node has three members: data contains the information, right and left members contain addresses to the nodes on either side. Ex. p->left represents the address of the node to the left of node p) (Do not submit any downloaded irrelevant code that will fetch Zero. Do not make a program with fictitious data. Just give the partial code that doses what is asked) (- dotted arrow indicates; there may be any number of nodes between the connecting nodes) Use this declaration: alist blist xlist m struct Node { int data; Node* left; Node* right; } Node* alist, *blist, *xlist, *temp;

Each function has local memory associated with it to hold incoming parameters, local variables, and (in some cases) temporary variables. This region of memory is called a stack frame.   Question 7 options:   True   False

Write C++ code to display all even numbers in the a doubly linked list pointed to by Dlist. Use while loop to scan all nodes from the start to the end. (Each node has three fields: a data field that contains the information, and right and left fields contain pointers to nodes on either side. Ex. p->left represents the address of the node to the left of node p) (any number of nodes in the linked list) Dlist 4 3 8 HIIN 7 1