1

In strictly binary tree, the out-degree of every node is either o or 2.

Correct Answer: true, true

Make the most of this question

This page focuses on one Data Structure and Algorithms (DSA) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

Data Structure and Algorithms (DSA) MCQ: In strictly binary tree, the out-degree of every node is either o or 2. | Extra Education