0
/ 10
What type of binary tree is this? 
Search Results
Individual Exercises
0
/ 10
What is the depth 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
/ 50
Write a method called listSearch() that takes in a target string and a list of other strings. This method returns a (possibly shorter)...
0
/ 10
For function decToBinary, write the missing parts of the recursion case. This function should return a string that stores the binary...
0
/ 10
Write a recursive function BSTsmallcount that, given a BST and a value key, returns the number of nodes having values less than key. Your...
0
/ 10
Write a recursive function that returns true if there is a node in the given binary tree with the given value, and false otherwise. Note...
0
/ 10
Write a recursive function to set the value for each node in a binary tree to be its depth then return the modified tree. Assume that...
0
/ 10
We define a "root-to-node path" to be any sequence of nodes in a tree starting with the root and proceeding downward to a given node. The...
0
/ 10
Write a recursive function int BTsumall(BinNode root) that returns the sum of the values for all of the nodes of the binary tree with...
0
/ 10
Given two binary trees, return true if they are identical (they have nodes with the same values, arranged in the same way).
Here are...
0
/ 10
The height of a binary tree is the length of the path to the deepest node. An empty tree has a height of 0, a tree with one node has a...
0
/ 10
Given a binary tree, check if the tree satisfies the property that for each node, the sum of the values of its left and right children...
0
/ 10
Write a recursive function int BTleaf(BinNode root) to count the number of leaf nodes in the binary tree pointed at by root. You must use...
0
/ 10
Given two binary trees, return true if and only if they are mirror images of each other. Note that two empty trees are considered mirror...
0
/ 10
Given two binary trees, return true if and only if they are structurally identical (they have the same shape, but their nodes can have...
0
/ 10
Given a binary tree, write a recursive function to return the difference between the sum of all node values at odd levels and sum of all...
0
/ 10
Write a recursive function that increments by one the value for every node in the binary tree pointed at by root, then returns the...
0
/ 10
Write a recursive function int countBTleaves(BinNode root) to count the number of leaf nodes in the binary tree pointed at by root. You...