Tree Data Structure

This data structure is a specialized method to organize and store data in the computer to be used more effectively. It consists of a central node, structural nodes, and sub-nodes, which are connected via edges.

• Linked List

• Stacks

• Queues

• Trees

What do you call the position of John in the image?

• Topmost

• Root

• Child

• Parent

What do you call Steve and Rohan?

• Root

• Parent

• Descendant

• Leaf

Emma, Tom, and Bill are considered ______ of Rohan.

• Descendants

• Childs

• Successors

• Parent

This is defined as the connection between two nodes.

• Edge

• Depth

• Height

• Degree

This is defined as the length of the path from the root to that node.

• Edge

• Height

• Depth

• Degree

Which of the following is not a characteristic of a Tree?

• It has no loop and no circuit

• We can access both ends.

• It has no self-loop 

• Its hierarchical model

A type of tree where parent node can have any number of child nodes or no restriction to the number of nodes.

• Binary Tree

• General Tree

• Balanced Tree

• Binary Search Tree

A type of tree which can only have a maximum of two child nodes.

• Binary Tree

• General Tree

• Balanced Tree

• Binary Search Tree

A type of tree where the height of the left sub-tree and the right sub-tree is equal or differs at most by 1

• Binary Tree

• General Tree

• Balanced Tree

• Binary Search Tree