static void TestBstInsert()
{
BinarySearchTree <int> tree = new BinarySearchTree <int>();
tree.Insert(0);
tree.Insert(4);
tree.Insert(11);
tree.Insert(2);
tree.Insert(1);
tree.Insert(50);
tree.InOrderTraversal();
tree.Remove(4);
Console.Out.WriteLine("");
tree.InOrderTraversal();
}
static void ex46()
{
BinarySearchTree <int> bt = new BinarySearchTree <int>();
BSTNode <int> node = new BSTNode <int>()
{
Value = 6,
Left = new BSTNode <int>()
{
Value = 5,
},
Right = new BSTNode <int>()
{
Value = 7,
Right = new BSTNode <int>()
{
Value = 8,
Right = new BSTNode <int>()
{
Value = 9,
Right = new BSTNode <int>()
{
Value = 10
}
}
}
}
};
bt.Root = new BSTNode <int>()
{
Value = 20,
Left = node
};
bt.InOrderTraversal();
ex_4_6 ex = new ex_4_6();
var res = ex.GetInOrderSuccessor(bt, node);
var val = res == null ? "null" : res.Value.ToString();
Console.Out.WriteLine($"res is {val}");
}
