When a binary tree is full to its next to last level and its leaves on the last level are filled from left to right the tree is

Question

sergij07 [2.7K]

3 years ago

14

When a binary tree is full to its next to last level and its leaves on the last level are filled from left to right the tree is

said to be
A. Ordered

B. Populated

C. Organized

D.complete

Computers and Technology

1 answer:

ikadub [295] · Answer 1 · 2022-04-02T16:04:01+03:00

Answer: D) Complete

Explanation:

A binary tree is said to be complete when, all the levels are completely fill except the last level. All the nodes leave in last level are all fill from left to right side in the binary tree.

If the current node in the binary tree indicated null value then, the tree are completely filled. If the last level is completely filled then,complete binary tree is known as perfect binary tree.