SDE - 1

which data structures to choose in order to allocate the proccesses based on priority and arrival time.(basic one but lots of variations too that I donot remember)

Given a singly linked list of 'N' nodes. The objective is to determine the middle node of a singly linked list. However, if the list has an even number of nodes, we return the second middle node.

Note:

1. If the list is empty, the function immediately returns None because there is no middle node to find.
2. If the list has only one node, then the only node in the list is trivially the middle node, and the function returns that node.

You have been given two exact same binary tree structures say ‘originalTree’ and ‘cloneTree’ and a reference to one of the nodes in ‘originalTree’.

You need to find the reference of the node in ‘cloneTree’, with the same value as the given node.

Note:

1. ‘cloneTree’ is an exact copy of the ‘originalTree’.
2. All nodes in ‘originalTree’ are distinct.
3. The given node in the ‘originalTree’ will not be  NULL.
4. You cannot change any of the two given trees.

State all steps based on system designing and software lifecyle.