2 votes 2 votes A tree with n nodes and the property that the heights of the two children of any node differ by at most 2 has O(log n) height. Please explain this statement to be true or false. Algorithms algorithms tree avl-tree + – LRU asked Nov 18, 2021 LRU 278 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Chandrabhan Vishwa 1 commented Nov 18, 2021 reply Follow Share i think it is correct 1 votes 1 votes Vishal_kumar98 commented Nov 19, 2021 reply Follow Share True statement 1 votes 1 votes Please log in or register to add a comment.
