About this document
Recursion Techniques for BSTs by ishu garg is a document available to read on EtoBox.
This document describes a programming assignment involving binary search trees (BSTs). Students are asked to write functions to: 1) print the keys of a tree, 2) remove leaf nodes, 3) find the inorder successor of a node, and more. The assignment involves writing recursive functions to traverse, modify, analyze, and build BSTs. Students must analyze the time complexity of their functions and include documentation.
- Author
- ishu garg
- Language
- EN