(C,7,6) (D,6,7) (E,3,8) (1,8,3) (G,8,7) (H,4,9) (F,7,9)
void f4() -- Suppose in the list there is only one node p having owner=D, and there are at least 6 nodes after p. Sort 6 elements after p ascendingly by color. The content of the output file f4.txt must be the following:
(C,9,8) (D,11,12) (E,8,7) (F,1,2) (1,7,9) (J,6,8) (K,5,6) (L,9,8) (M,3,4)
(C,9,8) (D,11,12) (F,1,2) (K,5,6) (E,8,7) (J,6,8) (L,9,8) (1,7,9) (M,3,4)
Question 2: (4 marks)
In this question you should complete some methods in BSTree.java file.
The class Cala with 3 data members: owner, horn and color is given and you do not need to edit it. The BSTree class is a binary search tree of Cala objects. The variable horn is the key of the tree, thus it must be unique. The following methods should be completed:
void insert(String xOwner, int xHorn, int xColor) - check if xOwner.charAt(0) == 'B' 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:
(A,7,9) (C,4,3) (D,8,6) (Ε,2,5) (Υ,6,-7) (F,-6,7)
(F,-6,7) (E,2,5) (C,4,3) (Υ,6,-7) (Α,7,9) (D,8,6)
void f2() - Perform breadth-first traversal from the root but display to file f2.txt nodes with non-
empty right 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) (F.2.-1) (J.3.9)
+ 127%
Zoom
Close
