Computer Science, asked by mahesss30, 1 month ago

What is AVL tree in data structure?

Answers

Answered by mahesijjh

AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes. An Example Tree that is an AVL Tree.

Answered by sjk17312

hope the above answr help u

Attachments:

Previous Question

Next Question

Similar questions

Math, 24 days ago

4. Explains why 7x11x13+13 and 7 x 6 x 5x 4 x 3 X 2 x 1 +5 are composite numbers.

Accountancy, 24 days ago

find gross profit ratio from the following information: net profit ₹100000; operating expenses ₹40000; interest on debentures ₹5000; profit on sale of investment ₹10000; net revenue from operations ₹675000...

Political Science, 24 days ago

"Democracy is not suitable at present times." Justify this statement by citing suitable arguments against democracy.

Hindi, 1 month ago

तुम जवाब दो इसका पर्यायवाची बताएं...

Math, 1 month ago

11) A Quadrilateral in which one pair of opposite sides are parallel and equal is a) Parallelogram b) Trapezium c) Kite d) none of the above...

Biology, 8 months ago

the period of which organism. lives in called...

Hindi, 8 months ago

कवयित्री के अनुसार मानव जीवन कैसा है ? * अमर नश्वर नाव ...

Math, 8 months ago

If 1 is a zero of a polynomial then ,its factor is (x+1)...