819279
| Question | Answer |
| 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. |
Want to create your own Flashcards for free with GoConqr? Learn more.