Height Balanced tree (AVL tree) AVL tree is a self-balancing binary search tree. show detail

Assume a binary tree with eachh node containing one integer, and its left child storing a number smaller than the current node (parent) and its right child storing a larger number. Build an AVL tree based on the sequence of integers as follows:

90, 57, 82, 48, 39, 21, 22

Show the process.