Assertion: tree's child | /r/HasProperty | a left-t rotation
Facets:
Source sentences:
text: its t t h {\displaystyle t^{th}} child, a left-t rotation at a {\displaystyle a} is done by making d {\displaystyle d} the root node, and making b {\displaystyle b} and all of its subtrees a child of a {\displaystyle a} , additionally we assign the m − 1 {\displaystyle m-1} left most children of d {\displaystyle d} to a {\displaystyle a} and the right most child of d {\displaystyle d} stays attached to it while d {\displaystyle d} is promoted to root, as shown below: