Stanford CS Education Library: this article introduces the basic concepts of binary trees, and then works through a series of practice problems with solution code in C/C++ and Java. Binary trees have an elegant recursive pointer structure,...More
Stanford CS Education Library: this article introduces the basic concepts of binary trees, and then works through a series of practice problems with solution code in C/C++ and Java. Binary trees have an elegant recursive pointer structure, so they make a good introduction to recursive pointer algorithms.
Presents the best recursive pointer problem it has ever been my pleasure to see.This an advanced problem that uses pointers, binary trees, linked lists, and some significant recursion. Solutions are provided in Java and C.
cslibrary.stanford.edu/109/TreeListRecursion.html
-
Get Site Info