Trees and Binary Trees

What is a tree in data structures?

• A linear data structure

• A non-linear data structure with parent-child relationships

• A type of array

• A collection of nodes without relationships

What is the maximum number of children a node can have in a binary tree?

• Unlimited

• Three

• Two

• One

In a binary search tree (BST), where are values less than a node's value located?

• Nowhere

• In the right subtree

• In the left subtree

• At the root

What is the degree of a node in a tree?

• The number of its children

• The total number of nodes in the tree

• The height of the tree

• The number of its parents

What is a full and complete binary tree?

• A tree with at least one child per node

• A tree where every node has two child on the same level

• A tree with no nodes

• A tree with at least 1 child node on the same level

Which traversal method visits the root node first?

• Preorder Traversal

• Level Order Traversal

• Postorder Traversal

• Inorder Traversal

What is the path from root to node 11

• 1 > 7 > 2

• 7 > 2 > 6 > 11

• 1 > 7 > 5 > 11

• 1 > 7 > 6 > 11

What is the term for nodes that share the same parent?

• Roots

• Children

• Leaves

• Siblings

What is the parent of the node with the value of 6

• 11

• 7

• 2

• 5

List all internal nodes.

• 3, 6, 10, 14

• 8, 3, 6, 14, 10

• 1, 4, 7, 13, 14

• 1, 4, 7, 13