Understanding Trees and Binary Trees

What is the basic structure of a tree in computer science?

• A linear sequence of elements

• A collection of nodes without any hierarchical structure

• A structure consisting of nodes and pointers with a root at the top

• A graph with nodes having an unlimited number of pointers

What are leaf nodes?

• Nodes with at least two child nodes

• Nodes at the very bottom of the tree with no children

• The topmost node of a tree

• Nodes that are not connected to any other nodes

How are nodes in a tree connected?

• Through indexes

• By arrays

• With pointers and edges

• Using classes

What is a subtree?

• A set of nodes and edges from any node down through all its descendants

• A binary tree within another binary tree

• A separate tree linked to the main tree

• The top half of a tree

Which of the following is a use of trees in computer science?

• Storing and managing file and folder structures

• Creating unlinked data clusters

• Linear data storage

• Performing arithmetic operations

Which algorithm might use trees for its implementation?

• Linear regression

• Binary search on arrays

• A* pathfinding

• Bubble sort

How many pointers can each node in a binary tree have?

• Only one

• Three or more

• Up to two

• Unlimited

What makes a binary tree different from a standard tree?

• Binary trees do not have a root node

• Each node in a binary tree can have a maximum of two pointers

• Standard trees are always balanced

• Binary trees cannot have leaf nodes

Which data structure is a binary tree a special case of?

• Graph

• Linked List

• Array

• Stack

How can binary trees be represented in memory?

• As dictionaries or objects with pointers

• As a single linked list

• Only as static arrays

• Using a queue