note:

Do it with any number

Soru 2 You will construct and answer this question according to your student ID. If your student number is even develop an algorithm to print a linked list in reverse order WITHOUT using recursion and working with O(N) complexity. You are NOT ALLOWED to reverse or modify linked list, and NOT ALLOWED to create another one or convert it to an array. If you violate any of these constraint your answer will NOT BE ACCEPTED!!! If your student number is odd develop an algorithm to print a Binary Search Tree (BST) from bottom-to-up and left-to-right with O(N) complexity. You are NOT ALLOWED to modify BST or create another one. If you violate any of these constraint your answer will NOT BE ACCEPTED!!! You are expected to describe the solution. You do NOT need to write code! You may write pseudo-code. If you can not explain your solution clear, you will get 0 (zero) mark! Your design will also be part of the evaluation. You MUST write down your ID first! If you don't write it your question will NOT BE ACCEPTED!!! If you do NOT answer the correct question your answer will NOT BE EVALUATED