Adegenerate tree might actually be less efficient than a linked list. why?

A degenerate tree is a tree which has the pattern of the parent node attached only to single child node .It can work in a dynamic manner and are also considered similar as the linked list.

Linked list are the dynamically working data structures having elements of the list to be connected through pointers in a linear manner. The unbalanced nature of the degenerate tree makes it less efficient which results in the low performance .Thus, degenerate tree doesn't have efficiency similar to linked list.

yes you can very simple, click the heart and then click the follow requests button.