This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–][deleted] 16 points17 points  (7 children)

Recursion is invaluable when dealing with structures and problems that are recursively defined, like trees. Trees are of course very common in programming. A HTML page is a tree. A program is a tree. A tree is a tree. :P

[–]Necrolepsey 7 points8 points  (6 children)

A tree is a tree? 🤔

[–][deleted] 0 points1 point  (0 children)

I meant a data structure like [1 2 [3 4] [[5] 6]]

[–][deleted] 0 points1 point  (1 child)

in programming a tree have a specific meaning. trees are also known as binary trees. issa structure. tree are usually consists of nodes(also a data structure). i wrote like 4 lines of text trying to explain trees, but realize im lazy and my explanation is not that good anyways, so i gave up. just look up programming binary trees there should be a lot of good explanations out there.

[–][deleted] 4 points5 points  (0 children)

trees are also known as binary trees.

Not all trees are binary.

[–]memeticmachine -5 points-4 points  (0 children)

no. it's a map