Solve
Guides
Join / Login
Use app
Login
0
You visited us
0
times! Enjoying our articles?
Unlock Full Access!
Question
What is a full binary tree?
A
Each node has exactly zero or two children
B
Each node has exactly two children
C
All the leaves are at the same level
D
Each node has exactly one or two children
Open in App
Solution
Verified by Toppr
Correct option is A. Each node has exactly zero or two children
Was this answer helpful?
0
Similar Questions
Q1
A full binary tree with n non leaf nodes contain
View Solution
Q2
The number of nodes in a full binary tree of depth 4 is
View Solution
Q3
A binary tree having r nodes and depth d is said to be complete binary tree if
View Solution
Q4
The inorder and preorder traversal of a binary tree are dbeafcg and abdecfg respectively. The postorder traversal of the binary tree is
View Solution
Q5
If the number of leaves in a tree is not a power of 2, then the tree is not a binary tree.
View Solution