Answer:
traversed
Explanation:
B-tree is a self balancing tree and it is a data structure which allows insertion, deletion operations.
inorder, preorder and post order, they all are traversing algorithms in the tree data structure.
inorder: first print left, then root and then right.
preorder: first print root, then left and then right.
postorder: first print left, then right and then root.
Therefore, the answer is traversed.
Answer:
UDP has more control as compare to TCP in terms of data and time.
a. In terms of data, an application has more control in UDP as compare to TCP, in terms of confidentiality and security of Data. As UDP use the process of encapsulation to secure the information, this will cause that UDP will know that what data is sent.
b. UDP has the ability to control the flow of data and traffic congestion control, while TCP has no congestion control which causes extra delays in application. Due to this reason UDP has better control over time to send the data.
<em>We can say that, UDP has better control than TCP.</em>
Answer:
False
Explanation:
Static local variables are destroyed when a function returns.
They are always destroyed after a function returns.