Which of the following statements is true regarding Threaded Binary Search Trees (TBST)?Marks : 1Negative Marks : 0Answer hereTBSTs are always taller than regular binary search trees.TBSTs can be efficiently traversed in both in-order and pre-order.TBSTs can be implemented without the need for in-order predecessor and successor pointers.TBSTs do not require any additional pointers or threading.

The true statement regarding Threaded Binary Search Trees (TBST) is: "TBSTs can be efficiently traversed in both in-order and pre-order."

Here's why:

1. "TBSTs are always taller than regular binary search trees." - This is not necessarily true. The height of a TBST depends on the order of insertion of nodes, just like a regular binary search tree.

2. "TBSTs can be implemented without the need for in-order predecessor and successor pointers." - This is false. The whole point of a TBST is to maintain in-order predecessor and successor pointers to make in-order traversal more efficient.

3. "TBSTs do not require any additional pointers or threading." - This is also false. TBSTs require additional pointers (threading) to point to the in-order predecessor or successor.

Therefore, the statement "TBSTs can be efficiently traversed in both in-order and pre-order." is true. The threading in TBSTs allows for efficient in-order traversal, and pre-order traversal is efficient in any binary search tree.