Karteikarten
data structures
Karten in diesem Stapel (9)
- 1Binary search tree, 3 main elements of a nodedata, node left, node right
- 2Binary search tree, where should be linked new nodesless data value should be inserted on left,
greater data values should be inserted right - 3Binary search tree main propertiesroot
parent
child
leaf - 4Binary search tree what is a leaf?A node that only is linked to its parent and has no childs
- 5Binary search tree what is root?is the first node of a binary tree
- 6Binary search tree explain add a node to a binary treechecks 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
- 7Binary search tree What is a pointer?Is a property of a node to contain a reference of another node
- 8Binary search tree how to delete a node as a leaffind the node and delete it,
and the parent node pointer set ti to null - 9Binary search tree how to delete a node in with one childfind the node delete it and set the parent pointer to the child of the removed node
Informationen
- Beschreibung
- Karteikarten am data structures, erstellt von Jayro Salgado am 16/02/2016.
- Erstellt von
- Jayro Salgado
- Aufrufe
- 0
- Tags
- Bewertung