BINARY TREE B1

A tree is composed of ____ connected by edges or lines

• Fruit

• Leaf Node

• Root Node

• Nodes

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

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

• Only one

• Up to two

• Three or more

• 
  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

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

What is the significance of null pointers in binary trees?

• They signify that a node has no child node

• Null pointers are not used in binary trees

• They indicate the end of the tree

• They are used to balance the tree

What operation can be performed on a binary tree?

• Multiplication

• Circular linking

• Inverting colors of nodes

• Adding nodes

How are nodes in a tree connected?

• Through indexes

• By arrays

• With pointers and edges

• Using classes

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