Question 5127 – UGC NET CS 2012 Dec-Paper-2
November 5, 2023Question 5133 – UGC NET CS 2012 Dec-Paper-2
November 5, 2023Question 5128 – UGC NET CS 2012 Dec-Paper-2
The worst case time complexity of AVL tree is better in comparison to binary search tree for
Correct Answer: D
Question 2 Explanation:
AVL tree is a self balancing tree with height difference at most 1. A balance factor in AVL tree is used to check what rotation to make.
Search and Insert Operations
Search and Delete Operations
Insert and Delete Operations
Search, Insert and Delete Operations
Subscribe
Login
0 Comments