clip10.Which of the following is true about a red-black tree?It is always a complete binary treeIt guarantees O(1) time complexity for searchIt follows the property of AVL treeIt has O(log n) time complexity for basic operations

The correct statement about a red-black tree is: "It has O(log n) time complexity for basic operations".

Red-black trees are a type of self-balancing binary search tree where each node contains an extra bit for denoting the color of the node, either red or black.

Here's why the other options are incorrect:

1. "It is always a complete binary tree": This is not true. A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible. A red-black tree does not necessarily meet this criterion.

2. "It guarantees O(1) time complexity for search": This is also not true. The search operation in a red-black tree has a time complexity of O(log n), not O(1).

3. "It follows the property of AVL tree": This is not true. AVL trees and red-black trees are both self-balancing binary search trees, but they follow different properties. For example, AVL trees are more rigidly balanced and hence provide faster look-ups, while Red