Array-based representation of binary trees - Nodes are stored in an array A - Node v is stored at A rank(v) rank(root) 1 if node is the left child or parent(node), rank(node) 2 rank(parent(node)) if node is the right child of the par...

oooooh thanks for that my dumbass read the literally for some reason. i read it as no Kiktil will be named the string literal "child name" lol

I believe the first question is asking is what data structure you are going to use to represent the hierarchical structure family tree of the kiktils, whilst question 6 is asking about all the other data structures you used to implement the other met...

Oh sorry I thought you meant lab2 as in the first assessed lab. As for the second assessed lab I am also a bit confused about what question 6 haha.

Hi bill, question 6 did ask for complexity as well. Question 6 is asking why your solution is correct as well as the time complexity of your solution. Here is my answer that I got full marks for Question 6 (1 mark) Give an argument for the correctn...

Hi there, just wanted to clarify some assumptions about the lab 1. Can we assume that no 2 kiktil will have the same name? I'm assuming this will be the case as if 2 kiktils had the same name, it would make the get cousin dist() function impossible t...

Tree ADT is covered in lecture 15, which I believe will be covered in the wed thurs lectures. Of course you can study the slides yourself and use the internet to study up. The lab becomes pretty self explanatory after you understand the tree ADT.

Hi there, in the readme.md, it says that we are to write our answers in the "answers.md" file which is provided. I can't seem to find this file on LMS. Are we to create our own answers.md or will it be provided? Also, I do not see this unit or the sub...