|
|
Created by Jayro Salgado
almost 10 years ago
|
|
| Question | Answer |
| Binary search tree, 3 main elements of a node | data, node left, node right |
| Binary search tree, where should be linked new nodes | less data value should be inserted on left, greater data values should be inserted right |
| Binary search tree main properties | root parent child leaf |
| Binary search tree what is a leaf? | A node that only is linked to its parent and has no childs |
| Binary search tree what is root? | is the first node of a binary tree |
| Binary search tree explain add a node to a binary tree | checks the node value if great or less than the first node, if less compare to the next left node recursively, same happen to right if bigger until found empty pointer |
| Binary search tree What is a pointer? | Is a property of a node to contain a reference of another node |
| Binary search tree how to delete a node as a leaf | find the node and delete it, and the parent node pointer set ti to null |
| Binary search tree how to delete a node in with one child | find the node delete it and set the parent pointer to the child of the removed node |
Want to create your own Flashcards for free with GoConqr? Learn more.