Tree - Quiz

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

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

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

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

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

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

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

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 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

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