I just treated the tree as not being binary as you can't have BEONE for example. I drew arrows for part I and drew a vague idea of each of the two words for part ii, putting a little explanation on the side in case my annotations are misunderstood.
I just treated the tree as not being binary as you can't have BEONE for example. I drew arrows for part I and drew a vague idea of each of the two words for part ii, putting a little explanation on the side in case my annotations are misunderstood.
Agreed, I also treated it like a normal tree. It didn't really make sense otherwise
I created a for loop for each of the elements in a row, and then set their position in the grid to grid(i+x,y), where y was static I was the element in the row you were at and x was the amount you had to shift by which was a passed parameter . Not sure if this would work though
I created a for loop for each of the elements in a row, and then set their position in the grid to grid(i+x,y), where y was static I was the element in the row you were at and x was the amount you had to shift by which was a passed parameter . Not sure if this would work though
I did very similar but I did ((i+x) mod 5) so if the value was 6 for example it would go to position 1
I just treated the tree as not being binary as you can't have BEONE for example. I drew arrows for part I and drew a vague idea of each of the two words for part ii, putting a little explanation on the side in case my annotations are misunderstood.
Aaah my mind went blank and all I could think of were binary trees rip - oh well, it was only 2 marks so should hopefully be alright!