Data Structure

Tree

⛪ Computer Science and Engineering > Data Structure

This set of multiple choice questions (MCQs) covers various concepts related to trees in data structure. Test your knowledge and improve your understanding of binary trees, binary search trees, AVL trees, red-black trees, and more. ➲ Tree - Quiz

Q 1: What is a binary tree?

  • A A tree with at most two children per node
  • B A tree with three children per node
  • C A tree with four children per node
  • D A tree with any number of children per node

Q 2: What is a root node in a tree?

  • A The node with no children
  • B The node with only one child
  • C The node at the top of the tree
  • D The node at the bottom of the tree

Q 3: What is a leaf node in a tree?

  • A The node with no children
  • B The node with only one child
  • C The node at the top of the tree
  • D The node at the bottom of the tree

Q 4: What is a binary search tree?

  • A A tree with at most two children per node
  • B A tree with three children per node
  • C A tree with four children per node
  • D A tree with any number of children per node

Q 5: What is the time complexity of searching a node in a binary search tree?

  • A O(log n)
  • B O(n)
  • C O(n log n)
  • D O(1)

Q 6: What is a height-balanced tree?

  • A A tree in which each node has at most one child
  • B A tree in which each node has exactly two children
  • C A tree in which the difference in height between the left and right subtrees of any node is at most 1
  • D A tree in which the difference in height between the left and right subtrees of any node is at most 2

Q 7: What is a trie?

  • A A type of binary search tree
  • B A data structure used for storing associative arrays where the keys are strings
  • C A data structure used for storing graphs
  • D A data structure used for storing sets

Q 8: What is a heap?

  • A A type of binary search tree
  • B A data structure used for storing associative arrays where the keys are strings
  • C A data structure used for storing graphs
  • D A data structure used for storing sets and can be used to implement priority queues

Q 9: What is an AVL tree?

  • A A tree in which each node has at most one child
  • B A tree in which each node has exactly two children
  • C A self-balancing binary search tree in which the difference in height between the left and right subtrees of any node is at most 1
  • D A self-balancing binary search tree in which the difference in height between the left and right subtrees of any node is at most 2

Q 10: What is a red-black tree?

  • A A tree in which each node has at most one child
  • B A tree in which each node has exactly two children
  • C A self-balancing binary search tree in which each node is colored either red or black
  • D A self-balancing binary search tree

Q 11: What is a full binary tree?

  • A A binary tree in which every node has either one or two children
  • B A binary tree in which every node has exactly two children
  • C A binary tree in which every node has at most two children
  • D A binary tree in which every node has at least two children

Q 12: What is a perfect binary tree?

  • A A binary tree in which every node has either one or two children
  • B A binary tree in which every node has exactly two children
  • C A binary tree in which all leaf nodes are at the same level and every non-leaf node has two children
  • D A binary tree in which all leaf nodes are at the same level and every non-leaf node has either one or two children

Q 13: What is an inorder traversal of a binary tree?

  • A Visiting the root node, then the left subtree, then the right subtree
  • B Visiting the left subtree, then the root node, then the right subtree
  • C Visiting the left subtree, then the right subtree, then the root node
  • D Visiting the right subtree, then the root node, then the left subtree

Q 14: What is a postorder traversal of a binary tree?

  • A Visiting the root node, then the left subtree, then the right subtree
  • B Visiting the left subtree, then the root node, then the right subtree
  • C Visiting the left subtree, then the right subtree, then the root node
  • D Visiting the right subtree, then the root node, then the left subtree

Q 15: Which data structure is used for implementing the Breadth First Search (BFS) algorithm on a tree?

  • A Stack
  • B Queue
  • C List
  • D Array

Q 16: What is a self-balancing binary search tree?

  • A A binary search tree that does not require any balancing
  • B A binary search tree that is always perfectly balanced
  • C A binary search tree that automatically re-balances itself to maintain its height and ensure fast operations
  • D A binary search tree that allows unbalanced nodes to remain unbalanced

Q 17: What is a threaded binary tree?

  • A A binary tree that allows for easy traversal of its nodes without requiring a stack or queue
  • B A binary tree in which every node has exactly two children
  • C A binary tree that uses threads (pointers to other nodes) to connect certain nodes, making traversal faster
  • D A binary tree that is not binary search tree

Q 18: What is a B-tree?

  • A A binary search tree that can have more than two children per node
  • B A binary tree in which every node has exactly two children
  • C A self-balancing binary search tree that maintains a height difference of at most 1 between subtrees
  • D A binary search tree that does not allow duplicates

Q 19: Which of the following operations can be performed in O(log n) time on a balanced binary search tree?

  • A Insertion
  • B Deletion
  • C Searching for a value
  • D All of the above

Q 20: Which of the following is an example of a trie?

  • A A binary search tree
  • B A red-black tree
  • C A B-tree
  • D A prefix tree