Try this exercise. Click the correct answer from the options.
Which of the following is true about binary trees?
Click the option that best answers the question.
- A binary tree is a tree data structure in which each node has at most two children.
- A binary tree is a tree data structure in which each node has exactly two children.
- A binary tree is a tree data structure in which each node can have any number of children.
- A binary tree is a tree data structure in which each node has at least three children.