A ___________ tree is a tree where for each parent node, there is only one associated child node

Options
- balanced binary tree
- rooted complete binary tree
- complete binary tree
- degenerate tree

CORRECT ANSWER : degenerate tree

Discussion Board
Data Structure - Degenerate Trees

A degenerate tree is a tree where for each parent node, there is only one associated child node. A degenerate tree is a tree where for each parent node, there is only one associated child node. It is unbalanced and, in the worst case, performance degrades to that of a linked list.

Prajakta Pandit 01-31-2017 11:05 PM

Degenerated binary tree

A degenerate tree is a tree where for each parent node, there is only one associated child node. This means that in a performance measurement, the tree will essentially behave like a linked list data structure.

Rajshree 07-2-2016 11:13 PM

Write your comments


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)


Related Content

Advertisement
 
▲