what is binary tree
Answers
Answered by
2
Answer:
A Tree in which each node has exactly zero or two children is called full binary tree. A Tree in which the degree of each node is 2 except leaf nodes is called perfect binary tree.
Answered by
3
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. ... From a graph theory perspective, binary (and K-ary) trees as defined here are actually arborescences.
Step-by-step explanation:
hope it helps you............
Similar questions