main

Question 1

stack

Answer 1

LIFO
to implement a stack you need to maintain a pointer at the top of the stack which is the last element to be added

Question 2

stack operations

Answer 2

push(item) adds a new item to the top of the stack
pop() removes and returns the top item from the stack
peek() returns the top item from the stack but does not remove it
IsEmpty() tests to see if the stack is empty
IsFull checks if the stack is full and returns a boolean value

Question 3

queue

Answer 3

FIFO
size of queue determines on the number of items in it

Question 4

queue operations

Answer 4

enqueue(item) adds a new item to the end of the queue
dequeue() removes the first item from the queue and returns it
IsEmpty() tests to see where queue is empty
IsFull tests to see whether queue is full

Question 5

Tree

Answer 5

root at top, leaves at the bottoms

a tree is only a binary tree a node can only have two children

Question 6

graph structure

Answer 6

undirected or directed
has vertices
directional or bi-directional

Question 7

how to delete leaf node in tree

Answer 7

Search tree until the required node is found
Set the parent node pointer to the leaf node to null