✓ Kizspy.me
•
void f10) Do not edit this method. Your task is to complete the insert(...) method above only.
Output in the file f1.txt must be the following:
(B,9,4) (C,4,3) (D,8,6) (Y,6,-7) (E,2,5) (F,-6,7)
(Y,6,-7) (C,4,3) (B,9,4) (E,2,5) (D,8,6) (F,-6,7)
•
void f2()-Perform post-order traversal from the root but display to file f2.txt nodes with song<7
only. Hint: Copy the function postOrder (...) to function postOrder2(...) and modify it. Output in
the file f2.txt must be the following:
(F,2,-1) (D,6,1) (G,7,3) (M,4,6) (K,-1,5) (1,1,7) (L,5,10) (J,3,9) (H,10,8) (E,9,4) (C,8,2)
(F,2,-1) (D,6,1) (M,4,6) (K,-1,5) (1,1,7) (L,5,10) (J,3,9)
• void f3() Suppose q is the node having largest wing in the tree. Check if q has father p then
delete p by copying. Output in the file f3.txt must be the following:
(C,8,2) (D,6,1) (E,9,4) (F,2,-1) (G,7,3) (H,10,8) (1,1,7) (1,3,9) (K,-1,5) (L,5,10) (M,4,6)
(C,8,2) (D,6,1) (E,9,4) (F,2,-1) (G,7,3) (H,10,8) (1,1,7) (L,5,10) (K,-1,5) (M,4,6)
void f40 Perform in-order traversal and find the 4th node p having left child. Rotate p
to right. Output in the file f4.txt must be the following:
(C,8,2) (D,6,1) (E,9,4) (F,2,-1) (G,7,3) (H,10,8) (1,1,7) (1,3,9) (K,-1,5) (L,5,10) (M,4,6)
(C,8,2) (D,6,1) (E,9,4) (F,2,-1) (G,7,3) (H,10,8) (K,-1,5) (J,3,9) (1,1,7) (L,5,10) (M,4,6)
Zoom
Question 3: (2 marks)
+ 102%
2
Close
