Construct an AVL tree by inserting the following key values in the given order into an empty AVL tree.$$Draw each tree after each insertion separately. In the final AVL tree, perform postorder traversal. $($A$$a$$daki de$$erleri$$s$$ras$$yla bo$$ bir AVL a$$ac$$na eklersek AVL a$$ac$$n$$n her ad$$m$$n$$iziniz$.$ Son a$$a$$ta ise postorder i$$lemi uygulay$$n$$z$.$

$50,25,10,5,7,62,55,20$