Tree - Quiz

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

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

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

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

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

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

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

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

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

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