Which of the following is true about Binary Trees?
(A)
Every binary tree is either complete or full.
(B)
Every complete binary tree is also a full binary tree.
(C)
Every full binary tree is also a complete binary tree.
(D)
No binary tree is both complete and full.
(E)
None of the above
Answer
Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!