Answer:
A Red Black Tree is a type of self-balancing(BST) in this tree ,each node is red or black colored. The red black tree meets all the properties of the binary search tree, but some additional properties have been added to a Red Black Tree.
A Red-Black tree's height is O(Logn) where (n is the tree's amount of nodes).
In a red-black tree with black height k
The maximum number of internal nodes is
.
The smallest possible number is
.
Answer:
The Matlab code is as given in the explanation, paste the code in the new script file, save it and run.
Explanation:
The code is as follows
Code:
<em>%% Initialization of the code</em>
<em>% The code takes an array of six AIS scores of the form [AIS1 AIS2 AIS3</em>
<em>% AIS4 AIS5 AIS6] of order 1x6.</em>
<em>AIS=input('Please enter the AIS array of the form [AIS1 AIS2 AIS3 AIS4 AIS5 AIS6]');%taking input of the array</em>
<em>AISs=sort(AIS,'descend');%sorting the array in the descending order</em>
<em>iss=(AISs(1,1)^2)+(AISs(1,2)^2)+(AISs(1,3)^2);%Calculating the ISS</em>
<em>disp(['The injury severity score (ISS) for the entered array is ', num2str(iss)])%Displaying the output</em>
Output:
<u><em>Please enter the AIS array of the form [AIS1 AIS2 AIS3 AIS4 AIS5 AIS6][3 0 4 5 3 0];</em></u>
<u><em>The injury severity score (ISS) for the entered array is 50</em></u>
<u><em /></u>
