This is the last assignment, and no late submissions are allowed.

Overview

This homework assignment includes all the exercises for Binary Search Trees and AVL.

Problems

$(7$ points$)$ What's the return node of next$(45)$

$(10$ points$)$ Please draw the binary search tree after insert$(30)$

$(10$ points$)$ Still based on the original tree, please draw the binary search tree after delete$(15)$

$(10$ points$)$ Consider the original tree as an AVL tree, please draw the AVL tree after insert$(13)$

$(15$ points$)$ Consider the original tree as an AVL tree, please draw the AVL tree after insert$(9),$ and insert$(8)$