Computer Programming - 12.1 to 12.7

Describe the differences between static and dynamic data types

Describe self-referencing structures

Describe the malloc and free functions

Describe how a linked list is created

ListNodePtr startPtr = NULL

Describe a way to search through a linked list

Describe a way to insert a new node into a linked list

Describe how to delete a node from a linked list

Describe how a stack is create

Describe insertions in stacks 

• Push

Describe Deletion in stacks

• Pop

Describe the creation of queues

Describe insertions in a queue

• Enqueue

Describe deletion in queues

• Dequeue

Describe the creation of binary trees

Describe sorted binary trees

Describe Binary Tree Inorder traversal

void inOrder(TreeNodePtr treePtr) {
    if (treePtr != NULL) {
        inOrder(treePtr->leftPtr);
        printf("%3d", treePtr->data);
        inOrder(treePtr->rightPtr);
    }
}

Describe Binary Tree Preorder traversal

void preOrder(TreeNodePtr treePtr) {
    if (treePtr != NULL) {
        printf("%3d", treePtr->data);
        preOrder(treePtr->leftPtr);
        preOrder(treePtr->rightPtr);
    }
}

Describe Binary Tree Postorder traversal

void postOrder(TreeNodePtr treePtr) {
    if (treePtr != NULL) {
        postOrder(treePtr->leftPtr);
        postOrder(treePtr->rightPtr);
        printf("%3d", treePtr->data);
    }
}