WGU c949 Ch12-15 QUESTIONS AND CORRECT ANSWERS RATED A+

WGU c949 Ch12-15 QUESTIONS AND CORRECT ANSWERS RATED A+singly-linked list a data structure (positional list) in which each list element contains a pointer to the next list element head/tail first/last node of singly-linked list Prepend Insert new node before head in SLL newNode -> next = list -> head code for prepend to SLL InsertAfter SLL inserts the new node after a provided existing list node node_a = Node(95) class Node: def __init__(self, initial_data): = initial_data = None #initialize the node 2 class LinkedList: def __init__(self): = None = None #how many data members are in the class? is which operator is used to test if two objects share the same memory current_node in remove_after() method this is the variable that is before the node to be removed doubly-linked list a linked list in which each element has both forward and backward pointers. positional list chaining hash table handles collision with key % x => multiple values per bucket linear probing hash table handles collisions by starting at the key's mapped bucket, and then linearly searches subsequent buckets until an empty bucket is found depth a node's _____ is the number of edges on the path from the root to the node level all nodes on the same depth live here tree height largest depth of any node full tree All nodes have 0 or 2 children complete tree all levels of a tree, except possibly the last level, are full and all nodes in the last level are as far left as possible perfect tree all internal nodes have 2 children and all leaf nodes are at the same level