Types of Trees Data Structure

A tree is composed of ____ connected by edges or lines.

• Fruit 
• Leaf Node
• Root Node
• Nodes

A Kind of tree where every node in a tree can have at most two children.

• Binary Tree
• Binary Expression Tree
• Tree
• Binary Search Tree

How many leaf are there in the tree?

• 1

• 3

• 4

• 7

What is the key characteristic of a balanced binary tree?

• The right subtree is always smaller than the left subtree.

• All levels of the tree are completely filled.

• The height difference between the left and the right subtree is at most 1.

• The left subtree is always smaller than the right subtree.

What is the value of the ROOT node in this Tree?

• 35

• 24

• 42

• 20

Which type of binary tree has every node with two children in the internal node?

• Full binary tree

• Complete binary tree

• Perfect binary tree

• Binary search tree

A Balanced Tree has equal number of items on each subtree.

• True
• False

What is Degenerate binary tree?

• A tree where every node has either 0 or 2 children.

• A tree where the height of the left and right subtrees of any node differ by at most one.

• A tree in which each parent node has only one child node associated with it.

• A tree where all internal nodes have exactly two children and all leaf nodes are at the same level.

What is perfect binary tree?

• A tree where every node has either 0 or 2 children.

• A tree where the height of the left and right subtrees of any node differ by at most one.

• A tree in which each parent node has only one child node associated with it.

• A tree where all internal nodes have exactly two children and all leaf nodes are at the same level.

Root

• data structure similar to a graph, with no loops.

• an object in a graph also known as a vertex

• a join of relationship between nodes - also know as an arc

• the starting node in a rooted tree structure from which all other nodes branch off.