I think it’s the last one.
<h2>Dead lock is possible in Bank Transactions</h2>
Explanation:
Let us understand the term "Dead lock"
A deadlock is a situation where whole set of process is locked, since each of the process is waiting or holding the resource of another process. Each process will be interdependent and waiting for the same resource.
Deadlock is possible during bank transaction in the following situation:
A & B are two accounts where A tries to transfer funds to B and B tries to transfer fund to A.
When both tries to transfer funds at the same time, deadlock occurs.
A deadlock can be avoided by any one of the four methods.
They are: Mutual exclusion, No preemption, circular wait, hold and wait.
Answer:
The new root will be 2.
<em></em>
Explanation:
The binary tree is not properly presented (See attachment)
To answer this; first, we need to order the nodes of the tree in a pre-order traversal.
We use pre-order because the question says if something is removed from the left child.
So, the nodes in pre-order form is: 14, 2, 1, 5, 4, 16.
The root of the binary tree is 14 and if 14 is removed, the next is 2.
<em>Hence, the new root will be 2.</em>