Puneet Tripathi

Adding Priority Queue into data structures folder

1

Priority Queue is a very important data structure with its use cases in many fields. It is a must addition to the data-structures. #### Description of Change #### Checklist -...

Added program to swap two numbers using bitwise

1

Detailed program to swap two numbers using bitwise operators. Also provided detailed proof of how the swapping happens. This program would be great for beginners to understand how we can...

Tree sort is an interesting sorting algorithm that takes advantage of BST in-order traversal to sort a given array. This algorithm would be a great addition to sorting algorithms. ####...

Improving time complexity of Priority Queues with help of Max-heap. Insertion time complexity, O(N) -> O(log(N)) - [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Java/blob/master/CONTRIBUTING.md). - [x] This pull request is all my...