CS 2413 – Lab 9
Chapter 10 – Efficient Binary Trees
a) Previous lab using trees
In a hospital, as patients enter, the front desk records their name and assign them a
priority number. These values will be inserted in a tree structure (a higher number
indicates a higher priority. Value larger than its parent should go to the right-hand side
while a value less than its parent should go to the left-hand side. Same way we
constructed trees in the class). Once you get information from several patients and
enter it into your tree structure, display this tree from the highest priority patient to the
lowest priority patient. (As shown in the sample output).
Sometimes a nurse may want to access a specific priority number and change its
value (Note: you are searching by the priority number, not the name). Write a function
that will allow a nurse to search for a specific priority number and change it. (Note: when
you change the priority number, you should put this node in the correct location of your
tree). Once you make these changes, display the tree again from the highest priority
patient to the lowest priority patent. (See the sample output).
(Hint: use of library functions from string.h header file will help when handling strings).
P.T.O ?
P.T.O ?
b) Leaf Nodes
Modify the above program so that it can display all the leaf nodes. When
displaying leaf nodes, it should print the names of each patient from left to
right as shown below.

Purchase answer to see full
attachment