What is a totally filled binary tree called?
Answers
Answered by
0
A binary tree is made of nodes, where each node contains a "left" reference, a "right" reference, and a data element. ... This node is called a parent. On the other hand, each node can be connected to arbitrary number of nodes, called children. Nodes with no children are called leaves, or external nodes.
Similar questions