$4.(6$ points$)$ Implement the DSW algorithm to balance a tree. Recall that the DSW method includes two phases:

Phase $1$: rotate to the right to transform the BST to a backbone.

Phase $2$: rotate to the left to transform the backbone to a balanced BST$.$

For example,

Phase $1$: Phase $2$: