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
What this episode covers
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
NOW PLAYING
Recursion Trees
No transcript for this episode yet
Similar Episodes
Jun 16, 2026 ·28m
Jun 14, 2026 ·31m
Jun 8, 2026 ·44m
Jun 2, 2026 ·45m
May 27, 2026 ·24m
May 25, 2026 ·43m