| Title | Inefficient Range Query in a BST Slideshow |
| Catalog Type | SLCItem |
| Persistent ID | https://opendsax.cs.vt.edu/OpenDSA/Metadata/inlineav/BTRecurTutor/IneffBinaryTreeRangeCON.html |
| Platform Name | OpenDSA |
| Features | Algorithm Visualization, Code Tracing Presentation |
| Description | Slideshow visualizing a range query implementation in a BST, contrasting an inefficient and an efficient implementation. |
| Keywords | Binary Search Tree |
| Author | Sally Hamouda, Cliff Shaffer |
| Institution | Virginia Tech |
| Iframe URL | https://opendsax.cs.vt.edu/OpenDSA/Metadata/inlineav/BTRecurTutor/IneffBinaryTreeRangeCON.html |
| Protocol | LTI 1.1, SPLICE |
| Protocol URL | |
| License | https://github.com/OpenDSA/OpenDSA/blob/master/MIT-license.txt |
| Programming Language | Java |
| Natural Language | en |