A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as\
Answers
Answered by
2
Answer:
A binary tree is also known as old programming term bifurcating ... All its levels, except possibly except possibly the last, have the ... nodes and; All the nodes at the last level appears as far left as possible.
Similar questions