Showing 0-0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Binary Search Tree Insert Proficiency Exercise | Tracing Exercise | Interactive exercise to demonstrate proficiency with BST insert. | OpenDSA | Binary Search Tree |
| 2 | Binary Search Tree Remove Proficiency Exercise | Tracing Exercise | Interactive exercise to demonstrate proficiency with BST remove. | OpenDSA | Binary Search Tree |
| 3 | Binary Search Tree Search Proficiency Exercise | Tracing Exercise | Interactive exercise to demonstrate proficiency with BST search. | OpenDSA | Binary Search Tree |
| 4 | Binary Search Tree Summary Questions | Question, Battery | Self-practice questions about Binary Search Trees. | OpenDSA | Binary Search Tree |
| 5 | BST Delete Max Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing recursive delete of the maximum value in a BST. | OpenDSA | Binary Search Tree |
| 6 | BST Insert Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing recursive insert in a BST. | OpenDSA | Binary Search Tree |
| 7 | BST Remove Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing recursive remove value in a BST. | OpenDSA | Binary Search Tree |
| 8 | BST Search Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing recursive search in a BST. | OpenDSA | Binary Search Tree |
| 9 | Inefficient Range Query in a BST Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing a range query implementation in a BST, contrasting an inefficient and an efficient implementation. | OpenDSA | Binary Search Tree |
| 10 | Tree inorder traversal | Python PredictingFinalResult for demonstrating Tree inorder traversal | QuizPET | binary search, trees | |
| 11 | Tree preorder traversal | Python PredictingFinalResult for demonstrating Tree preorder traversal | QuizPET | binary search, trees | |
| 12 | Tree | Python CodeVisualization for demonstrating Tree | JSVEE | binary search, trees | |
| 13 | Tree Node Access | Python CodeVisualization for demonstrating Tree Node Access | JSVEE | binary search, trees | |
| 14 | Binary Tree Chapter Summary Questions | Question, Battery | Self-practice questions for the full Binary Tree chapter. | OpenDSA | Binary Tree, Binary Search Tree, Heap, Huffman Coding Tree |
| 15 | Functional Programming Recursion: BST | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing list-of-list (tree) processing in a functional programming language: Binary Search Tree Search. | OpenDSA | Functional Programming |
| 16 | Paged BST Slideshow | Algorithm Visualization | Slideshow showing the use of paging with a BST-based index. Updating the BST to require it to remain a complete... | OpenDSA | Tree-Based Indexing |
| 17 | Paged BST with Page Rebalancing For Use on Disk Slideshow | Algorithm Visualization | Slideshow showing the use of paging with a BST-based index. Reorganizing the nodes to be on optimal disk pages reduces... | OpenDSA | Tree-Based Indexing |
| 18 | Tree Timeline Slideshow | Algorithm Visualization | Slideshow showing the concept of marking a timeline for the values stored in a BST. This will be contrasted with... | OpenDSA | Trie |
| 19 | Trie Timeline Slideshow | Algorithm Visualization | Slideshow showing the concept of marking a timeline for the values stored in a Trie decomposition version of a BST. | OpenDSA | Trie |