Linked Lists And Trees

Question 1

A linear data structure, much like an array, that consists of nodes, where each node contains data as well as a link to the next node, but that does not use contiguous memory.

Answer 1

Linked List

Question 2

Memory that is allocated as needed, and NOT contiguous (side-by-side), specifically during the implementation of a linked-list style data structure, which also includes binary trees and graphs.

Answer 2

Dynamic Memory

Question 3

In a linked list, tree, or similar graph-based structure, a _____ is an object linked to other objects, representing some entity in that data structure.

Answer 3

Node

Question 4

A data structure that does not occupy contiguous motors, such as linked list, graph, or tree.

Answer 4

Non-Linear Data Structure

Question 5

A node, including the root, which has one or more child nodes connected to it.

Answer 5

Parent Node

Question 6

A data structure that consists of nodes, with one root node at the base, and two nodes (left child and right child) extending from the root, and from each child node.

Answer 6

Binary Tree

Question 7

The term used in trees to indicate a node that extends from another node, such as left child and right child in a binary tree.

Answer 7

Children

Question 8

A tree in which there are no missing nodes when looking at each level of the tree. The lowest level of tree may not be completely full, but may not have any missing nodes. All other levels are full.

Answer 8

Complete Tree

Question 9

In a tree data structure, the _____ of the tree is mostly commonly expressed as the number of steps from the root of the tree to the farthest outlying node in the tree. Height is also used to mean the same thing.

Answer 9

Depth

Question 10

A potential node in a tree, where currently either the left or right child pointer of a node is pointing to null, but potentially could reference another node.

Answer 10

External Node

Question 11

A tree in which nodes are inserted systematically in order, with the final property of each left child being less than or equal to its parent, and each right child being greater than its parent.

Answer 11

Binary Search Tree

Question 12

A tree in which everyone aren’t is lesser in value than both its children, which means that the root of the tree is least value in the tree.

Answer 12

Minimum Heap Tree

Question 13

A tree in which every parent is greater in value than both its children, which means that the root of the tree is greatest value in the tree.

Answer 13

Maximum Heap Tree.

Question 14

A tree in which every level of the tree is completely full, with no missing nodes.

Answer 14

Full Tree

Question 15

The process of systematically visiting every node in a tree once. The three most common are pre-order, in-order, and post-order.

Answer 15

Tree Traversal

Question 16

A non-executable, visual approach to help determine the pre-order, in-order, or post-order traversal of a tree.

Answer 16

Full Tree Traversal

Question 17

The process of systematically visiting every node in a tree once, starting with the root node, proceeding to the left along the tree and accessing the node when the “left” side of the node is encountered.

Answer 17

Pre-Order Transversal

Question 18

The process of systematically visiting every node in a tree once, starting at the root and proceeding left down the tree, accessing the first node encountered as its “center,” proceeding likewise along the tree, accessing each node as encountered at the “center.”

Answer 18

In-Order Transversal

Question 19

The process of systematically visiting every node in a tree once, starting at the root and proceeding left down the tree, accessing the first node encountered at its “right” side, proceeding likewise along the three, accessing each node as encountered at its “right” side.

Answer 19

Post-Order Transversal

Question 20

An existing node in a tree, either the root or any other of the children in the tree.

Answer 20

Internal Node

Question 21

In tree processing, this is the sum of all the lengths from the root to the external nodes in a tree.

Answer 21

Internal Path Length

Question 22

A node in a tree data structure that has no children, and is at the end of a branch in a tree.

Answer 22

Leaf

Question 23

A tree is a widely used abstract data type (ADT) or data structure implementing this ADT that simulates a hierarchical tree structure, with a root value and sub tree of children with a parent node, represented as a set of linked nodes.

Answer 23

Tree Topology