public void PriorityUpdateTest() { var change = new List <TreapValueNode>(); foreach (var node in tree) { if (r.Next() % 2 == 0) { change.Add(node); } } foreach (var node in change) { node.Priority += r.Next(100) - r.Next(100); tree.PriorityUpdate(node); CompareLog(); Assert.IsTrue(compare.OrderBy(t => t.Key).SequenceEqual(tree)); } }