F453 Data Structures - Binary Trees

Descrição

FlashCards sobre F453 Data Structures - Binary Trees, criado por harvs899 em 02-05-2014.
harvs899
FlashCards por harvs899, atualizado more than 1 year ago
harvs899
Criado por harvs899 mais de 10 anos atrás
178
8

Resumo de Recurso

Questão Responda
Is a binary tree a static or dynamic data structure? Dynamic.
What is the maximum number of child nodes each parent node can have? Two, hence why it is called a binary tree.
What is the first node called? The root node.
What are sibling nodes? Nodes which share the same parent node.
What is the problem with removing parent nodes from a binary tree? And what is a solution? All nodes below the deleted item will be lost, in order to maintain the structure of the tree the 'deleted' item can be flagged as deleted with a boolean value and thus will be ignored by any tree traversal algorithms.

Semelhante

Computing Hardware - CPU and Memory
ollietablet123
A level Computing Quiz
Zacchaeus Snape
All AS Maths Equations/Calculations and Questions
natashaaaa
Using GoConqr to teach French
Sarah Egan
Using GoConqr to teach science
Sarah Egan
Using GoConqr to study geography
Sarah Egan
Using GoConqr to study Economics
Sarah Egan
Using GoConqr to study English literature
Sarah Egan
Using GoConqr to learn French
Sarah Egan
A Level: English language and literature techniques = Structure
Jessica 'JessieB
A Level: English language and literature technique = Dramatic terms
Jessica 'JessieB