Showing 0-0 of 0 results
# Exercise Title Features Description Platform Keywords
1 Construct an inorder traversal function Construct an inorder traversal function that recursively traverse a tree from left node, root node and right node. We store... jsParsons trees
2 Construct a preorder traversal function Construct a preorder traversal function that recursively traverse a tree from root node, left node and right node. We store... jsParsons trees
3 Tree traversal. Challenge The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order... PCEX trees
4 Tree Python CodeVisualization for demonstrating Tree JSVEE binary search, trees
5 Tree Node Access Python CodeVisualization for demonstrating Tree Node Access JSVEE binary search, trees
6 Tree traversal. The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order... PCEX binary search, trees
7 Inserting binary tree Challenge In a BinaryTree, adding new nodes to the tree is an important capability to have.\nConstruct a simple implementation of a... PCEX recursion, trees
8 Tree inorder traversal Python PredictingFinalResult for demonstrating Tree inorder traversal QuizPET binary search, trees
9 Tree preorder traversal Python PredictingFinalResult for demonstrating Tree preorder traversal QuizPET binary search, trees
10 Inserting binary tree In a BinaryTree, adding new nodes to the tree is an important capability to have. Construct a simple implementation of... PCEX binary search, recursion, trees
11 Binary search Binary Search operates by dividing an array in half, and then determining whether or not the target value would be... PCEX binary search, recursion, search, search algorithms, sorting, trees
12 Context-Free Language Derivation Trees Frameset Programmed Instruction Programmed Instruction Frameset discussing derivation trees for Context-Free Grammars. OpenDSA Context-Free Language
13 Context-Free Language Derivation Trees Example Algorithm Visualization Visualization of a derviation tree from a given context-free grammar. OpenDSA Context-Free Language
14 Binary Search Tree Summary Questions Question, Battery Self-practice questions about Binary Search Trees. OpenDSA Binary Search Tree
15 Huffman Coding Proficiency Exercise Tracing Exercise Practice profiency exercise for Huffman Coding Trees. User must do actions like show the codes for a string, or vice... OpenDSA Huffman Coding Tree
16 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
17 Choosing the Best Indexing Method Question, Battery Self-test question battery on which is the best indexing choice for a given scenario. OpenDSA Tree-Based Indexing
18 Tree Indexing Proficiency Exercise Question, Battery Tree-based indexing proficiency exercise. User indicates the number of disk pages visited for a given tree. OpenDSA Tree-Based Indexing
19 Building a B+ Tree of Degree 5 Algorithm Visualization Slideshow showing a series of insert operations in a B+ Tree of degree 5. OpenDSA Tree-Based Indexing, B-Tree
20 Building a B+ Tree of Degree 4 Algorithm Visualization Slideshow showing a series of insert operations in a B+ Tree of degree 4. OpenDSA Tree-Based Indexing, B-Tree
21 Deletion from a B+ Tree of Degree 4 Algorithm Visualization Slideshow showing a series of delete operations in a B+ Tree of degree 4. OpenDSA Tree-Based Indexing, B-Tree
22 Search in a B+ Tree of Degree 4 Algorithm Visualization Slideshow showing a series of search operations in a B+ Tree of degree 4. OpenDSA Tree-Based Indexing, B-Tree
23 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
24 Promote Key on Insertion into a 2-3 tree. Algorithm Visualization Slideshow showing how keys can be promoted on insertion into a 2-3 tree. OpenDSA Tree-Based Indexing, 2-3 Tree
25 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
26 Simple Insertion into a 2-3 tree. Algorithm Visualization Slideshow showing simple insertion into a 2-3 tree. OpenDSA Tree-Based Indexing, 2-3 Tree
27 Split on Insertion into a 2-3 tree. Algorithm Visualization Slideshow showing how node split on insertion is handled by a 2-3 tree. OpenDSA Tree-Based Indexing, 2-3 Tree
28 Building a 2-3+ Tree Slideshow Algorithm Visualization Slideshow showing a series of insertions into a 2-3+ tree. OpenDSA Tree-Based Indexing, 2-3 Tree
29 Deletion from a 2-3+ Tree Algorithm Visualization Slideshow showing a series of delete operations in a 2-3+ tree. OpenDSA Tree-Based Indexing, 2-3 Tree
30 Search in a 2-3+ Tree Algorithm Visualization Slideshow showing a series of search operations in a 2-3+ tree. OpenDSA Tree-Based Indexing, 2-3 Tree
31 Path lengths in binary tree Code Completion Your task is to compute a set of all path lengths in a binary tree. For example, given this tree, CodeCheck Tree Structures
32 Letter frequency map Code Completion Your task is to produce a map of the frequencies of all letters in a string. Letters are represented as... CodeCheck Tree Structures
33 Unique words in two string sets Code Completion Implement a method that receives two arrays of strings and determines which words are unique to each. CodeCheck Tree Structures
34 Make Person class comparable Code Completion The program below will fail to run because the Person class does not implement the Comparable interface. Modify the class... CodeCheck Tree Structures
35 Hash code for Person class Code Completion When you add instances of the given Person class in a HashSet, the resulting hash set is too large. Evidently,... CodeCheck Tree Structures
36 Map words to their lengths Code Completion Given an array of strings, create a tree map with each string as a key and its corresponding value the... CodeCheck Tree Structures
37 Letter set Code Completion Your task is to produce a set of all letters in a string. Letters are represented as strings of length... CodeCheck Tree Structures
38 Hash code for LabeledPoint Code Completion Implement the hashCode method for the LabeledPoint class so that equal objects have the same hash code and that unequal... CodeCheck Tree Structures
39 A fast priority queue Code Completion It is possible to provide a fast priority queue implementation if the inserted items have a bounded number of integer... CodeCheck Tree Structures
40 Map word lengths to words Code Completion Given an array of strings, create a tree map whose keys are the string lengths and whose values are the... CodeCheck Tree Structures
41 B+ Tree Insertion Proficiency Exercise Tracing Exercise Interactive proficiency exercise for insertion into a B+ Tree. User clicks on tree nodes to indicate how the insert process... OpenDSA B-Tree, Tree-Based Indexing
42 Parsing an Expression Algorithm Visualization, User Supplied Data Algorithm Visualization for generating the parse tree of a user-supplied mathematical expression. Demonstrates that the associated grammar enforces the correct... OpenDSA Parse Tree
43 KD Tree Visualization Algorithm Visualization Algorithm Visualization illustrating the KD Tree. OpenDSA KD Tree
44 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
45 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
46 Binary Tree Traversal Summary Questions Question, Battery Self-practice questions about binary tree traversals. OpenDSA Binary Tree Traversal
47 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
48 General Tree Sequential Representation Proficiency Exercise Tracing Exercise User must show the sequential representation for a given general tree. OpenDSA Sequential Representation, General Tree
49 Binary Tree Sequential Representation Proficiency Exercise Tracing Exercise User must show the sequential representation for a given binary tree. OpenDSA Sequential Representation, Binary Tree
50 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
51 General Tree Postorder Traversal Slideshow Algorithm Visualization Slideshow showing postorder traveral of a general tree, and demonstrates the general tree ADT. OpenDSA General Tree
52 General Tree Preorder Traversal Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow showing preorder traveral of a general tree, and demonstrates the general tree ADT. OpenDSA General Tree
53 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
54 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
55 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
56 Parse Tree Example: Enforcing Order of Operations Algorithm Visualization Slideshow visualizing a parse tree from a grammar that enforces the correct order of operations. OpenDSA Parse Tree
57 Parse Tree Example for a Math Expression Algorithm Visualization Slideshow visualizing generation of a parse tree for a simple math expression. OpenDSA Parse Tree
58 Ambiguous Parse Tree Example for a Math Expression Algorithm Visualization Slideshow visualizing how generation of a parse tree from a grammar might be ambiguous. OpenDSA Parse Tree
59 Ambiguous Parse Tree Example for a Math Expression: 2 Algorithm Visualization Slideshow visualizing a second example of how generation of a parse tree from a grammar might be ambiguous. OpenDSA Parse Tree
60 Constructing a Binomial Tree Algorithm Visualization Slideshow showing a small example of building a binomial tree. OpenDSA Binomial Tree
61 Binary Search Tree Insert Proficiency Exercise Tracing Exercise Interactive exercise to demonstrate proficiency with BST insert. OpenDSA Binary Search Tree
62 Binary Search Tree Remove Proficiency Exercise Tracing Exercise Interactive exercise to demonstrate proficiency with BST remove. OpenDSA Binary Search Tree
63 Binary Search Tree Search Proficiency Exercise Tracing Exercise Interactive exercise to demonstrate proficiency with BST search. OpenDSA Binary Search Tree
64 Huffman Coding Tree Build Visualization Algorithm Visualization, User Supplied Data Visualization for building a Huffman Coding Tree from a set of weights supplied by the user. OpenDSA Huffman Coding Tree
65 Kruskal's Minimal-Cost Spanning Tree Proficiency Exercise Tracing Exercise Proficiency exercise for Kruskal's minimal-cost spanning tree. User must indicate the order in which nodes are visited by clicking on... OpenDSA Minimal-Cost Spanning Tree
66 Prim's Minimal-Cost Spanning Tree Proficiency Exercise Tracing Exercise Proficiency exercise for Prim's minimal-cost spanning tree. User must indicate the order in which nodes are visited by clicking on... OpenDSA Minimal-Cost Spanning Tree
67 Determining Number of Parse Tree Nodes Exercise: Alternate Calculation Exercise, Battery User determines the number of nodes in a parse tree generated by a given string on a given grammar. Alternative... OpenDSA Context-Free Grammar, Parse Tree
68 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
69 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
70 Determining Number of Parse Tree Nodes Exercise Calculation Exercise User determines the number of nodes in a parse tree generated by a given string on a given grammar. OpenDSA Context-Free Grammar, Parse Tree
71 BST Delete Max Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing recursive delete of the maximum value in a BST. OpenDSA Binary Search Tree
72 BST Insert Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing recursive insert in a BST. OpenDSA Binary Search Tree
73 BST Remove Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing recursive remove value in a BST. OpenDSA Binary Search Tree
74 BST Search Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing recursive search in a BST. OpenDSA Binary Search Tree
75 Huffman Coding Tree Slideshow: Build Algorithm Visualization Slideshow visualizing the Huffman Coding Tree construction algorithm: Building the tree from a collection of weighted elements. OpenDSA Huffman Coding Tree
76 Huffman Coding Tree Slideshow: Setting Codes Algorithm Visualization Slideshow visualizing the Huffman Coding Tree code setting step. OpenDSA Huffman Coding Tree
77 Huffman Coding Tree Slideshow: Decoding Algorithm Visualization Slideshow visualizing the process of decoding a string of Huffman Codes. OpenDSA Huffman Coding Tree
78 Huffman Coding Tree Slideshow: Label Edges Algorithm Visualization Slideshow visualizing the Huffman Coding Tree edge labeling step. OpenDSA Huffman Coding Tree
79 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
80 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
81 Kruskal's Minimal-Cost Spanning Tree Algorithm slideshow Algorithm Visualization Slideshow demonstrating Kruskal's algorithm for constructing the minimal cost spanning tree for a graph. OpenDSA Minimal-Cost Spanning Tree
82 Prim's Minimal-Cost Spanning Tree Algorithm slideshow Algorithm Visualization Slideshow demonstrating Prim's algorithm for constructing the minimal cost spanning tree for a graph. OpenDSA Minimal-Cost Spanning Tree
83 Unambiguous CFG Parse Tree Example Algorithm Visualization Visualization for the parse tree generated for a mathematical expression from a non-ambiguouse CFG. OpenDSA Context-Free Language, Parse Tree
84 Determining Whether a Given String is Derivable from Given Grammar Exercise: Alternate Calculation Exercise, Battery A collection of self-practice questions where users determine which strings can or cannot be derived from a given grammar: Alternate. OpenDSA Context-Free Grammar, Parse Tree
85 CFG Ambiguity 1 Exercise Question A question where users determine whether a given string is parsed ambiguously or not. OpenDSA Context-Free Grammar, Parse Tree
86 Determining Whether a Given String is Derivable from Given Grammar Exercise Question A question where users determine which strings can or cannot be derived from a given grammar. OpenDSA Context-Free Grammar, Parse Tree
87 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
88 Recursive Tree Processing: Value Summation Tracing Exercise A question related to tree processing in a functional programming language: Value summation. OpenDSA Functional Programming
89 Recursive Tree Processing: Substitution Question A question related to tree processing in a functional programming language: Substitution. OpenDSA Functional Programming
90 Recursive Tree Processing: Substitution 2 Question A question related to tree processing in a functional programming language: Substitution 2. OpenDSA Functional Programming
91 Recursive Tree Processing: Mystery Function Tracing Exercise, Battery A collection of self-practice questions related to tree processing in a functional programming language: Mystery Function. OpenDSA Functional Programming
92 q_py_tree_inorder_traverse_es Python PredictingFinalResult for demonstrating q_py_tree_inorder_traverse_es QuizPET
93 q_py_tree_preorder_traverse_es Python PredictingFinalResult for demonstrating q_py_tree_preorder_traverse_es QuizPET
94 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
95 Typical Mistakes During Tree Traversal Code Tracing Presentation Slideshow demonstrating some typical mistakes when writing recursive binary tree traversals. OpenDSA Preorder Traversal
96 Recursive Operations in a Binary Tree Presentation Slideshow discussing recursive operations on a binary tree. OpenDSA Array-Based Stack
97 Lambda Calculus: How to Build a Parse Tree Algorithm Visualization, Code Tracing Presentation Slideshow visualizing building a parse tree for lambda calculus expressions. OpenDSA Lambda Calculus
98 Functional Programming Recursion: Summing Elements in a Tree Algorithm Visualization, Code Tracing Presentation Slideshow visualizing list-of-list (tree) processing in a functional programming language: sum all values. OpenDSA Functional Programming
99 Call Structure for the Fibonacci Sequence Problem Algorithm Visualization Slideshow showing the tree structure for calls by a recursive implementation of the Fibonacci sequence calculation. OpenDSA Dynamic Programming, Fibonacci Sequence
100 Call Structure for the Chained Matrix Multiplication Problem Algorithm Visualization Slideshow showing the tree structure for calls by a solution to the chained matrix multiplication problem. OpenDSA Dynamic Programming, Chained Matrix Multplication Problem
101 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
102 Construir un programa que genere combinaciones únicas de 3 dígitos Construye un programa que cree e imprima todas las combinaciones de tres digitos de los numeros del 1 al 4... jsParsons
103 Construir un programa que genere combinaciones únicas de 3 dígitos Construye un programa que cree e imprima todas las combinaciones de tres digitos de los numeros del 1 al 4... jsParsons
104 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
105 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
106 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
107 PR Quadtree Interactive Visualization Algorithm Visualization, User Supplied Data PR Quadtree Visualization that allows the user to click on locations to insert points to be inserted into or deleted... OpenDSA PR Quadtree
108 Union/Find Proficiency Exercise Tracing Exercise Proficiency exercise for the Union/Find algorithm to maintain a collection of disjoint sets. User must show the complete sequence of... OpenDSA Union/Find Algorithm
109 Bintree Interactive Visualization Algorithm Visualization, User Supplied Data Interactive Algorithm Visualization for the Bintree data structure. User can click to indicate where a point should be inserted or... OpenDSA Bintree
110 Pair class with compareTo method Code Completion We sometimes want to compare two Pair objects, for example, when using pairs as keys in a tree map. CodeCheck Generic Types