About this document
CSD201: Binary Search Tree Tasks by Dang Hoang Viet (K17 HCM) is a document available to read on EtoBox.
1. The document contains questions about binary search trees (BSTs), including drawing BSTs from data, implementing BST functions recursively and iteratively, and deleting nodes from a BST. 2. Functions are provided to find the minimum/maximum nodes, search for a node, insert nodes, count nodes, levels and leaves, and check if a tree is a BST. 3. Code snippets are given with blanks to be filled in to complete implementations of finding the minimum/maximum nodes, searching, inserting nodes recursively and
- Author
- Dang Hoang Viet (K17 HCM)
- Language
- EN