0 votes 0 votes Give proper reasoning.. akash.dinkar12 asked Nov 4, 2017 akash.dinkar12 812 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments akash.dinkar12 commented Nov 4, 2017 reply Follow Share They have given this solution: 0 votes 0 votes MIRIYALA JEEVAN KUMA commented Jan 18, 2018 reply Follow Share In worst case insertion require O(logn) time for AVL tree. So O(logn) is highest upperbound. We can't cross it. ref: https://courses.csail.mit.edu/6.006/spring11/rec/rec04.pdf 1 votes 1 votes Shiva Sagar Rao commented Apr 26, 2021 reply Follow Share https://gateoverflow.in/182777/insertion-in-avl 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Time Complexity =O(logn) First finding position of n+1 element is logn Second for balancing =log(n+1) Total Time complexity =O(logn) Pranav Komakula answered Apr 26, 2021 Pranav Komakula comment Share Follow See all 0 reply Please log in or register to add a comment.