Hire Our Expert Programmer & Technical Writer to do your Capstone Project
0 votes
in Programming Languages & Algorithms by (user.guest)

1 Answer

+1 vote
by (user.guest)
selected by (user.guest)
Best answer
AVL tree is a binary search tree in which the difference of heights of left and right subtrees of any node is less than or equal to one. The technique of balancing the height of binary trees was developed by Adelson, Velskii, and Landi, as a result it was named after the abbreviation of the three names as AVL tree. An AVL tree is said to be balanced when both left and right subtrees are balanced.

Related questions

0 votes
1 answer 274 views
0 votes
0 answers 109 views
asked Oct 25, 2021 in Programming Languages & Algorithms by (user.guest)
0 votes
1 answer 238 views
+1 vote
1 answer 304 views
Welcome to CPENTalk.com

Disclaimer: Every user is solely responsible for anything that he/she posts or uploads on CPENTalk.