Sign in to save your progress, vote, and build your own decks.Sign in
Unit 1.4.2 Data Structures
19 cards·by gurundus
What is an advantage of using a Record as a data structure?
It is more user friendly
What is the disadvantage of using a record as a data structure?
All attribtues must be defined before the record can be used, this makes installation of the
structure more complicated
What constitutes a Array?
Arrays require their size to be specified when they are defined and htis is the number of
elements within it
What are the four functions that can be performed on stacks?
push(element), pop(), empty() and full()
What are the four functions that can be performed on Queue?
enqueue(element), dequeue(), empty() and full()
What are some examples of traversable Structures?
Tree, Binary Search Trees and Graph
What are methods of Traversal of trees?
Preorder, Inorder, Postorder and Breadth First Traversal
What is the first step of preorder Traversal?
if the node is not null/empty then continue
What is the second step or preorder Traversal?
Output the data of the current node
What is the third step of preorder Traversal?
Go to the left and start again
What is the forth step of preorder Traversal?
Go to the right and start again
What is the first step of inorder Traversal?
if the node is not null/empty then continue
What is the second step of inorder Traversal?
Output the data of the current node
What is the forth step of Inorder Traversal?
Go to the right and start again
how is "starting again" performed when using Traversal?
The function is called recursively
What is the first step of postorder Traversal?
If the node is not null/empty then continue
What is the second step of postorder Traversal?
Go to the left and start again
What is the third step of postorder Traversal?
Go to the right and start again
What is the forth step of postorder Traversal?
Output the data of the current node