file f2.txt must be the following:
☑ Kizspy. me (C,8,2) (D,6,1) (F,2,-1) (1,1,7) (K,-1,5) (1,3,9) (L,5,10) (M,4,6) (G,7,3) (E,9,4) (H,10,8)
(1,1,7) (K,-1,5) (J,3,9) (L,5,10) (M,4,6) (H,10,8)
•
void f3() -Suppose p is the 3rd node when performing the pre-order traversal of the tree.
Calculate number of nodes in the sub-tree with root p and suppose this number is k, then set
p.info.type = k.
(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,6) (G,7,3) (H,10,8) (1,1,7) (J,3,9) (K,-1,5) (L,5,10) (M,4,6)
Zoom
•
void f40)-Suppose p is the 2nd node having left-child when performing the post-order
traversal of the tree from the root. 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) (1,1,7) (J,3,9) (K,-1,5) (M,4,6) (L,5,10)
Otio 2.17
+ 100%
2
Close
