0
/ 40
Complete the following linear search method. Find the string search in the array words. If the string is found, return the string found....
Search Results
Searching for: cci
Individual Exercises
0
/ 40
Complete the following binary search method on characters. Find the character search in the array letters. Return the index of the...
0
/ 10
What is the root node of the tree shown here? 
0
/ 10
How many internal nodes there are in the tree shown here?
0
/ 10
What is the depth (aka height) of the tree shown here?
0
/ 10
Select all of the nodes that are children of node 10 in the binary tree shown here.
0
/ 10
What type of binary tree is this? 
0
/ 10
What is the depth (aka height) of the tree shown here?
0
/ 10
How many nodes are at level 3 in this tree?
0
/ 10
Parenthesized notation
A binary tree can be represented in parenthesized notation. The image below shows an example of how to represent...
0
/ 10
Parenthesized notation
A binary tree can be represented in parenthesized notation. The image below shows an example of how to represent...
0
/ 10
Parenthesized notation
A binary tree can be represented in parenthesized notation. The image below shows an example of how to represent...
0
/ 10
Parenthesized notation
A binary tree can be represented in parenthesized notation. The image below shows an example of how to represent...
0
/ 10
Parenthesized notation
A binary tree can be represented in parenthesized notation. The image below shows an example of how to represent...
0
/ 10
Parenthesized notation
A binary tree can be represented in parenthesized notation. The image below shows an example of how to represent...
0
/ 1
Convert the linear search given below to use a Comparable. The documentation for the interface Comparable can be found online.
You don't...
0
/ 1
Description
Write a recursive method int countDigits(int n) that returns how many digits are in n. The key idea on recursion in this...
0
/ 1
Description
In English, there are some mechanical rules to turn a singular noun to plural. For this exercise, complete the method String...
0
/ 1
Description
Write a recursive method int sumDigits(int n) that returns the sum of all the digits in n. The key idea over recursion in...
0
/ 1
Description
Given a string, compute recursively a new string where all spaces in the original one are replaced by an underscore (_).
So...
0
/ 1
Description
Given a string, compute recursively a new string where all the adjacent chars are now separated by an underscore ("_"). So...
0
/ 1
Given a string, compute recursively a new string where a space is removed and the next letter is converted to uppercase.
So given "Hello...
0
/ 1
Given a string, compute recursively a new string where uppercase letters in the original one are preceeded with a space in the new...
0
/ 1
Description
Given a string, compute recursively a new string where all vowels in the original string will now be in upper case in the new...
0
/ 1
Description
Write a recursive Java method that removes adjacent duplicate characters from a String. If two identical characters appear...