In which of the following self – balancing binary search tree the recently accessed element can be accessed quickly? - Study24x7
Social learning Network
study24x7

Default error msg

Login

New to Study24x7 ? Join Now
Already have an account? Login
26 Mar 2019 10:01 AM study24x7 study24x7

In which of the following self – balancing binary search tree the recently accessed element can be accessed quickly?

A

AVL tree

B

AA tree

C

Splay tree

D

Red – Black tree

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles