Recursion Trees episode artwork

EPISODE · Feb 28, 2020 · 17 MIN

Recursion Trees

from Programmers · host Software Engineering

In graph theory, a recursive tree is a non-planar labeled rooted tree. A size-n recursive tree is labeled by distinct integers 1, 2, ..., n, where the labels are strictly increasing starting at the root labeled 1. Recursive trees are non-planar, which means that the children of a particular node are not ordered

Episode metadata supplied by the publisher feed · Published Feb 28, 2020

Embed this episode

Ready to play

Recursion Trees

0:00 17:59

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

Frequently Asked Questions

How long is this episode of Programmers?

This episode is 17 minutes long.

When was this Programmers episode published?

This episode was published on February 28, 2020.

Can I download this Programmers episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!