each node in a binary tree has
Answers
Answered by
8
Answer:
In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child
Explanation:
hope this helps please mark me as brainlist
Answered by
1
Answer:
two children, which are referred to as the left child and the right child.
Explanation:
please Mark me Brainliest i need one
Similar questions