Computer Science and Engineering › Tree › Question #5634
Single Choice Easy

QWhat is a full binary tree?

ID: #5634 Tree 343 views
Question Info
#5634Q ID
EasyDifficulty
TreeTopic
Start Quiz on This Topic
 Your Answer

Choose the Best Option

Click any option to instantly check if you're correct.

  • 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 ✔ ✖
Correct Answer

Explanation

Answer: b) A binary tree in which every node has exactly two children
 Continue Practice
Previous Question Next Question
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

What is an AVL tree?... Which of the following is an example of a trie?... What is a perfect binary tree?... What is a binary tree?... What is a heap?... Which of the following operations can be performed in O(log n) time on a balanced binary search tree?... What is a B-tree?... What is a leaf node in a tree?... What is a threaded binary tree?... What is an inorder traversal of a binary tree?...