public void AvlTree_LeftRotate_Simple_Test_1()
{
// this requires left rotation
var tree1 = new Implementations.BinarySearchTree(1);
var tree2 = tree1.BstInsert(2);
var tree3 = tree1.BstInsert(3);
var rotate = tree1.AvlLeftRotate();
rotate.Parent.Key.Should().Be(2);
rotate.Left.Should().BeNull();
rotate.Right.Should().BeNull();
var parent = rotate.Parent;
parent.Key.Should().Be(2);
parent.Left.Key.Should().Be(1);
parent.Right.Key.Should().Be(3);
parent.Parent.Should().BeNull();
var parentRight = parent.Right;
parentRight.Key.Should().Be(3);
parentRight.Left.Should().BeNull();
parentRight.Right.Should().BeNull();
parentRight.Parent.Key.Should().Be(2);
}
public void AvlTree_LeftRotate_Simple_Test_4()
{
var tree1 = new Implementations.BinarySearchTree(1);
var tree2 = tree1.BstInsert(2);
var rotate = tree1.AvlLeftRotate();
rotate.Key.Should().Be(1);
rotate.Left.Should().BeNull();
rotate.Right.Should().BeNull();
rotate.Parent.Should().Be(tree2);
tree2.Parent.Should().BeNull();
tree2.Left.Should().Be(tree1);
tree2.Right.Should().BeNull();
}
