searching for priority Queue (min heap or max heap) in C# , what is efficient structure? [duplicate]

Question

I am searching for priority Queue (min heap or max heap) in C# , is there built in data structure in C# , what's that ? , how is it efficiency ?
tips : 1-efficient Working with memory
2-Fast in Insert and remove

Answer 1

There's my Priority Queue in C#. Also, a lighter-weight version is at A Generic Binary Heap Class.

The second one is more memory-efficient than the first.

Neither is "fast in search." Searching a heap is not an efficient operation. Heaps are designed to quickly insert and quickly remove the first item.