3450223
Descripción
Fichas por pstevens1963, actualizado hace más de 1 año
|
Creado por pstevens1963
hace más de 8 años
|
|
| Pregunta | Respuesta |
| Binary Tree Data Structure | Made up of nodes with a maximum of two nodes coming off each node |
| Add an item to a Binary Tree | Start at Root Repeat Compare new data with current data If new data < current THEN data follow left pointer Else follow right pointer Until pointer is null Add item and create null pointers |
| Delete from Binary Tree | Traverse binary tree until item found Remove elements below item and store them Delete item Transfer stored items back into the binary tree |
| Traversal Types | Pre-Order In-Order Post-Order |
| Pre-Order Traversal | Process Root Node Process Left Subtree Process Right Subtree (Each node is processed as visited left before right) |
| In-Order Traversal | Process Left Subtree Process Root Node Process Right Subtree (Each node is processed once child node on left is processed first) |
| Post-Order Traversal | Process Left Subtree Process Right Subtree Process Root Node (Each node is processed once child nodes have been processed left before right) |
| Implement a Binary Tree | Use Left, Right and Data Nodes Uses Left, Right Pointers 0 or -1 is the Sentinel value |
| Linked List | Dynamic data structure used to keep data in order E.g. Alphabetical Order |
| Linked List Variables | Start Next Free |
¿Quieres crear tus propias Fichas gratiscon GoConqr? Más información.