An IT company stores information about the completed projects and its budgets. They started their first project for a budget of 67 lakhs. Then, they had a series of projects for 54, 78, 34, 83, 45, 72 and 85 lakhs respectively. The manager presents this information to his team in a tree fashion by arranging the projects in such a way that the first project is the root element and the other records by checking for minimum or maximum value and inserting as per the requirement. Use appropriate data structures to device an algorithm to store the above information and find the third minimum and maximum project budget based on indexes from the overall collection of given set of projects.