Showing 0-0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Binary Tree Definition Calculation Questions | Question, Battery, Calculation Exercise | Self-practice questions about binary tree terminology that require calculation of quantities such as node counts and tree heights. | OpenDSA | Binary Tree |
| 2 | Binary Tree Terminology Practice Questions | Question, Battery | Self-practice questions about binary tree terminology that require calculation of quantities such as descendants and tree heights. | OpenDSA | Binary Tree |
| 3 | 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 |
| 4 | Binary Tree Traversal Summary Questions | Question, Battery | Self-practice questions about binary tree traversals. | OpenDSA | Binary Tree Traversal |
| 5 | Tree Implementation Overhead Exercise | Calculation Exercise, Battery | Self-practice questions that require the user to calculate overhead fractions for various binary tree node implementations. | OpenDSA | Binary Tree, Overhead |
| 6 | Binary Tree Sequential Representation Proficiency Exercise | Tracing Exercise | User must show the sequential representation for a given binary tree. | OpenDSA | Sequential Representation, Binary Tree |
| 7 | Binary Tree Serialization Slideshow: Internal Node Mark Bits | Algorithm Visualization | Slideshow how to reconstruct a binary tree from a serialized representation of its node values. Alternative representation using mark bits... | OpenDSA | Serialization, Binary Tree |
| 8 | Binary Tree Serialization Slideshow | Algorithm Visualization | Slideshow how to reconstruct a binary tree from a serialized representation of its node values. | OpenDSA | Serialization, Binary Tree |
| 9 | General Tree Serialization Slideshow | Algorithm Visualization | Slideshow how to reconstruct a general tree from a serialized representation of its node values. | OpenDSA | Serialization, Binary Tree |
| 10 | Alternative Binary Tree Sequential Representation Proficiency Exercise | Tracing Exercise | User must show the sequential representation for a given binary tree. This representation marks internal nodes. | OpenDSA | Sequential Representation, Binary Tree |
| 11 | Full Binary Tree Sequential Representation Proficiency Exercise | Tracing Exercise | User must show the sequential representation for a given full binary tree. The representation uses a bit vector to deduce... | OpenDSA | Sequential Representation, Full Binary Tree |
| 12 | Traverse an expression tree | Algorithm Visualization, Code Tracing Presentation | Slideshow demonstrating traversal of an expression tree. The primary point is to highlight the node implementation for a full binary... | OpenDSA | Expression Tree, Binary Tree Traversal, Full Binary Tree |
| 13 | Full Binary Tree Serialization Slideshow: Mark Bits | Algorithm Visualization | Slideshow how to reconstruct a full binary tree from a serialized representation of its node values. All that is needed... | OpenDSA | Serialization, Binary Tree |
| 14 | Inserting binary tree | In a BinaryTree, adding new nodes to the tree is an important capability to have.\nConstruct a simple implementation of a... | PCEX | ||
| 15 | Inserting binary tree | In a BinaryTree, adding new nodes to the tree is an important capability to have.\nConstruct a simple implementation of a... | PCEX | ||
| 16 | Complete Binary Tree Calculation Questions | Calculation Exercise, Battery | Self-practice questions requiring user to calcuate node positions and values in an array representation for a complete binary tree. | OpenDSA | Linked List |
| 17 | Recursive Operations in a Binary Tree | Presentation | Slideshow discussing recursive operations on a binary tree. | OpenDSA | Array-Based Stack |
| 18 | Typical Mistakes During Tree Traversal | Code Tracing Presentation | Slideshow demonstrating some typical mistakes when writing recursive binary tree traversals. | OpenDSA | Preorder Traversal |
| 19 | Inorder Traversal Shown in Detail | Algorithm Visualization, Code Tracing Presentation | Slideshow presenting a detailed visualization of inorder traversal of a binary tree and how the recursion works. | OpenDSA | Inorder Traversal |
| 20 | Postorder Traversal Shown in Detail | Algorithm Visualization, Code Tracing Presentation | Slideshow presenting a detailed visualization of postorder traversal of a binary tree and how the recursion works. | OpenDSA | Postorder Traversal |
| 21 | Preorder Traversal Shown in Detail | Algorithm Visualization, Code Tracing Presentation | Slideshow presenting a detailed visualization of preorder traversal of a binary tree and how the recursion works. | OpenDSA | Preorder Traversal |
| 22 | Tree inorder traversal | Python PredictingFinalResult for demonstrating Tree inorder traversal | QuizPET | binary search, trees | |
| 23 | Tree preorder traversal | Python PredictingFinalResult for demonstrating Tree preorder traversal | QuizPET | binary search, trees | |
| 24 | Tree | Python CodeVisualization for demonstrating Tree | JSVEE | binary search, trees | |
| 25 | Tree Node Access | Python CodeVisualization for demonstrating Tree Node Access | JSVEE | binary search, trees | |
| 26 | Binary Search Tree Insert Proficiency Exercise | Tracing Exercise | Interactive exercise to demonstrate proficiency with BST insert. | OpenDSA | Binary Search Tree |
| 27 | Binary Search Tree Remove Proficiency Exercise | Tracing Exercise | Interactive exercise to demonstrate proficiency with BST remove. | OpenDSA | Binary Search Tree |
| 28 | Binary Search Tree Search Proficiency Exercise | Tracing Exercise | Interactive exercise to demonstrate proficiency with BST search. | OpenDSA | Binary Search Tree |
| 29 | Binary Search Tree Summary Questions | Question, Battery | Self-practice questions about Binary Search Trees. | OpenDSA | Binary Search Tree |
| 30 | BST Delete Max Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing recursive delete of the maximum value in a BST. | OpenDSA | Binary Search Tree |
| 31 | BST Insert Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing recursive insert in a BST. | OpenDSA | Binary Search Tree |
| 32 | BST Remove Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing recursive remove value in a BST. | OpenDSA | Binary Search Tree |
| 33 | BST Search Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing recursive search in a BST. | OpenDSA | Binary Search Tree |
| 34 | 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 |
| 35 | 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 |
| 36 | py_trees_insert_binarytree | PCEX Set of activities for py_trees_insert_binarytree | PCEX |