Must an AVL tree satisfy the characteristics of a BST to be considered an AVL tree? [closed]

Question

Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.

---

Questions asking for code must demonstrate a minimal understanding of the problem being solved. Include attempted solutions, why they didn't work, and the expected results. See also: Stack Overflow question checklist

Closed 8 years ago.

Improve this question

Or does AVL tree only characterize a tree where all subtrees have a height balance of at most 1 ?

Answer 1

Typically, the term AVL tree refers to the balanced binary search tree data structure. There's no reason you couldn't talk about AVL trees to refer to the shape of the tree rather than the data structure represented by that shape, and it is often useful to do so (for example, if you wanted to implement an order-statistic tree on top of an AVL tree structure).

Hope this helps!