Data structure using C

What is a tree in data structures?

• a) A linear data structure

• A hierarchical, non-linear data structure

• A type of array

• A type of queue

In a tree, what is the first node called?

• a) Leaf

• b) Parent

• c) Root

• d) Child

How many root nodes can a tree have?

• a) One

• b) Two
  

• c) Unlimited
  

• d) Zero

The connection between two nodes in a tree is called?

• a) Leaf

• b) Edge
  

• c) Parent
  

• d) Sibling

A node with no child is known as?

• a) Root node

• b) Parent node

• c) Leaf node

• d) Internal node

What is a Binary Search Tree (BST)?

• a) A tree where left children are always greater than the root

• b) A tree where right children are always smaller than the root

• c) A tree where left children are smaller and right children are greater than the root

• d) A tree with only one child per node

Which traversal method visits the root node first?

• a) Inorder
  

• b) Postorder
  

• c) Preorder
  

• d) Level order

What is a forest in a tree structure?

• a) A single tree
  

• b) A set of disjoint trees
  

• c) A type of leaf node
  

• d) A connected graph

The total number of edges in the longest path from a node to a leaf is called?

• a) Depth
  

• b) Height
  

• c) Degree
  

• d) Level