void insert(String xOwner, int xHorn, int xColor) check if xOwner.charAt(0) == 'A' then do nothing, otherwise insert new Cala object with owner=xOwner, horn=xHorn, color=xColor to the tree (horn and color can get arbitrary, even negative values).
void f1() 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 breadth-first traversal from the root but display to file f2.txt nodes with non-empty left child only. Hint: Copy the function breadth(...) to function breadth2(...) and modify it.
Output in the file f2.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) (J,3,9) (K,-1,5) (L,5,10) (M,4,6)(
(C,8,2) (D,6,1) (E,9,4) (H,10,8) (1,1,7)
void f3()-Suppose p is the 6th node when performing the breadth-first traversal of the tree and fa is p's father. Delete p by copying. Output in the file f3.txt must contain 3 lines: statements to display line 1 and line 3 are already given. You must use the statement f.writeBytes(fa.info + "\r\n
"); to display fa in line 2.
+ 100%
Zoom
Close
