You have a large data set of an area with income and number of people having that income. You want to create an efficient search system using Binary Search Tree (BST) to search an income and related count. Input to be read from in.txt file: Consider a file (you have to create in.txt file and copy the sample data shown below) with the total number of unique incomes (N) in the first line and next N lines will contain the income and corresponding count of people with that income separated by space. Output: display the result in the console. Do not spend too much time producing the exact output format as we will check the output manually. Tasks: [you have to write a set of functions and test them. Some of them are fairly small] 1. Create a binary search tree based on income as the key. However, you should also store the corresponding count within the BST node. 2. Print the data in the tree in the in-order traversal to see the keys are in sorted order. Print them like comma-separated tuple (income, count), (income, count), .... 3. Write a function that prints all the incomes with the odd number of people count. 4. Write a function to find the total number of people having the highest income from your tree. You must use recursive functions for your solutions and calculate the results from the tree. There is a small grade for just creating the tree as the sample code is already provided. Also, do not hard-code just to give the numbers as output without calculating them (-150% penalty will be applied in that case). Sample Input Output: in.txt 7 6000 10 10000 2 9000 5 4000 9 11000 1 13000 2 8000 4 Console output/also out.txt file contains same information: Tree constructed from the file In-order: (4000, 9), (6000, 10), (8000,4), (9000,5), (10000, 2), (11000, 1), (13000,2), Incomes with Odd number of people count: 4000 9000 11000 Total number of people with the highest income: 2
You have a large data set of an area with income and number of people having that income. You want to create an efficient search system using Binary Search Tree (BST) to search an income and related count. Input to be read from in.txt file: Consider a file (you have to create in.txt file and copy the sample data shown below) with the total number of unique incomes (N) in the first line and next N lines will contain the income and corresponding count of people with that income separated by space. Output: display the result in the console. Do not spend too much time producing the exact output format as we will check the output manually. Tasks: [you have to write a set of functions and test them. Some of them are fairly small] 1. Create a binary search tree based on income as the key. However, you should also store the corresponding count within the BST node. 2. Print the data in the tree in the in-order traversal to see the keys are in sorted order. Print them like comma-separated tuple (income, count), (income, count), .... 3. Write a function that prints all the incomes with the odd number of people count. 4. Write a function to find the total number of people having the highest income from your tree. You must use recursive functions for your solutions and calculate the results from the tree. There is a small grade for just creating the tree as the sample code is already provided. Also, do not hard-code just to give the numbers as output without calculating them (-150% penalty will be applied in that case). Sample Input Output: in.txt 7 6000 10 10000 2 9000 5 4000 9 11000 1 13000 2 8000 4 Console output/also out.txt file contains same information: Tree constructed from the file In-order: (4000, 9), (6000, 10), (8000,4), (9000,5), (10000, 2), (11000, 1), (13000,2), Incomes with Odd number of people count: 4000 9000 11000 Total number of people with the highest income: 2
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![You have a large data set of an area with income and number of people having that income. You want to create an efficient search system using Binary Search Tree (BST)
to search an income and related count.
Input to be read from in.txt file: Consider a file (you have to create in.txt file and copy the sample data shown below) with the total number of unique incomes (N) in the
first line and next N lines will contain the income and corresponding count of people with that income separated by space.
Output: display the result in the console. Do not spend too much time producing the exact output format as we will check the output manually.
Tasks: [you have to write a set of functions and test them. Some of them are fairly small]
1. Create a binary search tree based on income as the key. However, you should also store the corresponding count within the BST node.
2. Print the data in the tree in the in-order traversal to see the keys are in sorted order. Print them like comma-separated tuple (income, count), (income, count), ....
3. Write a function that prints all the incomes with the odd number of people count.
4. Write a function to find the total number of people having the highest income from your tree.
You must use recursive functions for your solutions and calculate the results from the tree. There is a small grade for just creating the tree as the sample code is already
provided. Also, do not hard-code just to give the numbers as output without calculating them (-150% penalty will be applied in that case).
Sample Input Output:
in.txt
7
6000 10
10000 2
9000 5
4000 9
11000 1
13000 2
8000 4
Console output/also out.txt file contains same information:
Tree constructed from the file
In-order: (4000, 9), (6000, 10), (8000,4), (9000,5), (10000, 2), (11000, 1), (13000,2),
Incomes with Odd number of people count: 4000 9000 11000
Total number of people with the highest income: 2](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F7bfddd47-a914-4f67-b7e8-f2b18f1a0345%2F5d536b59-eaf9-432a-8c82-f7abaa35bca5%2F5efl07p_processed.jpeg&w=3840&q=75)
Transcribed Image Text:You have a large data set of an area with income and number of people having that income. You want to create an efficient search system using Binary Search Tree (BST)
to search an income and related count.
Input to be read from in.txt file: Consider a file (you have to create in.txt file and copy the sample data shown below) with the total number of unique incomes (N) in the
first line and next N lines will contain the income and corresponding count of people with that income separated by space.
Output: display the result in the console. Do not spend too much time producing the exact output format as we will check the output manually.
Tasks: [you have to write a set of functions and test them. Some of them are fairly small]
1. Create a binary search tree based on income as the key. However, you should also store the corresponding count within the BST node.
2. Print the data in the tree in the in-order traversal to see the keys are in sorted order. Print them like comma-separated tuple (income, count), (income, count), ....
3. Write a function that prints all the incomes with the odd number of people count.
4. Write a function to find the total number of people having the highest income from your tree.
You must use recursive functions for your solutions and calculate the results from the tree. There is a small grade for just creating the tree as the sample code is already
provided. Also, do not hard-code just to give the numbers as output without calculating them (-150% penalty will be applied in that case).
Sample Input Output:
in.txt
7
6000 10
10000 2
9000 5
4000 9
11000 1
13000 2
8000 4
Console output/also out.txt file contains same information:
Tree constructed from the file
In-order: (4000, 9), (6000, 10), (8000,4), (9000,5), (10000, 2), (11000, 1), (13000,2),
Incomes with Odd number of people count: 4000 9000 11000
Total number of people with the highest income: 2
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY