an avl tree is balanced, therefore a median of all elements in the tree is always at the root or one of its two children
Answers
Answered by
2
An AVL tree is a binary tree data structure that balances itself out to make searching it ... AVL Tree is a BST that is “ALMOST” balanced. ... If it has N nodes, its height is log2(N + 1).
Answered by
1
An avl tree is balanced, therefore a median of all elements in the tree is always at the root or one of its two children.
Hope this helps ☺️☺️☺️☺️
Similar questions