Recursion Trees

Programmers Quickie - Un pódcast de Software Engineering

Categorías:

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

Visit the podcast's native language site