Which of the following is/are true in case of tree locking?
A. It ensures shorter waiting times.
B. It ensures freedom from deadlock.
C. Transaction can lock data items earlier.
D. It does not ensure greater amount of concurrency.
Choose the correct answer from the options given below:

Correct option is C

Tree locking is a concurrency control method used to manage access to hierarchical data structures like B-trees. In tree locking:
B: It ensures freedom from deadlock by avoiding cycles in lock acquisition.
C: Transactions can lock data items earlier, ensuring that necessary locks are acquired as the transaction progresses through the tree.
Shorter waiting times and greater concurrency are not guaranteed by tree locking.