Question

describe the operations and implementations of avl tree

Answer 1

Answer:

Avi tree is a self balancing binary research tree where the difference height of left and right sub trees cannot be more than one for all nodes .

Explanation:

IMPLEMENTATIONS

1.perfoem the normal BST insertion

2.the current node must be one of the ancestors of the newly inserted node

3. Get the balance factor of the current node .

OPERATIONS:-

1.handel insertion

2. deletion ,and search operation in time .