A tree data structure in which each node has at most two children.
New cards
2
Root
The top node of a tree from which all nodes descend.
New cards
3
Complete Binary Tree
A binary tree where every level, except possibly the last, is completely filled and all nodes are as far left as possible.
New cards
4
Perfect Binary Tree
A binary tree where all internal nodes have two children and all leaves are at the same depth.
New cards
5
Height of a tree
The longest path from the root to a leaf, counted by the number of edges.
New cards
6
Min number of leaves
Occurs in a degenerate tree where each node has only one child.
New cards
7
In-order Traversal
A tree traversal method where the left subtree is visited first, followed by the root node, then the right subtree.
New cards
8
Pre-order Traversal
A tree traversal method where the root node is visited first, followed by the left subtree and then the right subtree.
New cards
9
Post-order Traversal
A tree traversal method where the left and right subtrees are visited first, followed by the root node.
New cards
10
Binary Search Tree (BST)
A type of binary tree where the left sub-tree has nodes with values less than the root, and the right sub-tree has nodes with values greater than or equal to the root.
New cards
11
Finding Minimum in BST
The process of locating the node with the smallest value in a binary search tree.
New cards
12
Finding Maximum in BST
The process of locating the node with the largest value in a binary search tree.
New cards
13
Delete Node with One Child
The action of removing a node which is replaced by its only child.
New cards
14
Delete Node with Two Children
The action of removing a node which requires replacing it with either its inorder predecessor or successor.
New cards
15
Adjacency List
A way of representing a graph where each node has a list of its adjacent nodes.
New cards
16
Traversal Order
The sequence in which the nodes of a tree are visited during traversal.
Studied by 0 people
