Are you sure you're getting this? Click the correct answer from the options.
Which of the following statements is true about balanced trees?
Click the option that best answers the question.
- Balanced trees have a time complexity of O(1) for searching, inserting, and deleting elements
- Balanced trees ensure that the heights of the left and right subtrees of any node differ by at most one
- Balanced trees cannot have more than two children for any node
- Balanced trees are only useful for small datasets