A ____ is a type of binary tree where the tree automatically balances itself as items are inserted or removed.

  • AVL Tree
  • B-Tree
  • Heap
  • Red-Black Tree
A Red-Black Tree is a type of binary search tree that automatically balances itself during insertions and deletions to ensure the tree remains approximately balanced. This property ensures efficient search and insertion operations.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *