Below is an implementation of binary search on a list of integers. Fill in the remaining lines to complete the method. You can always...

# Search Results

Searching for: binary

## Individual Exercises

Below is an implementation of binary search on a list of objects of type T. In this case, you can assume that T will always extend...

For function 'decToBinary', write the missing parts of the recursion case. This function should return a string that stores the binary...

Write a recursive function `BSTsmallcount`

that, given a BST and a value `key`

, returns the number of nodes having values less than `key`

. Your...

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...

Write a recursive function to set the value for each node in a binary tree to be its depth. Assume that nodes store integer values. On...

We define a "root-to-leaf path" to be any sequence of nodes in a tree starting with the root node and proceeding downward to a leaf. The...

Write a recursive function that returns the sum of the values for all of the nodes of the binary tree with root "root".

Given two binary trees, return true if they are structurally identical (they have nodes with the same values, arranged in the same way).

...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...

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...

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...

Write a recursive function to increment by one the value for every node in the binary tree pointed at by "root" then return the modified...

Write a recursive function to count the number of leaf nodes in the binary tree pointed at by "root". Assume there is "isLeaf" method to...

Given two binary trees, return True if and only if they are mirror images of each other.

Given two binary trees, return True if and only if they are structurally identical (ignoring the content of the nodes).

Write a recursive function `BSTsmallcount`

that, given a BST and a value `key`

, returns the number of nodes having values less than `key`

. Your...

Write a recursive function `BSTsmallcount`

that, given a BST and a value `key`

, returns the number of nodes having values less than `key`

. Your...

`BSTsmallcount`

that, given a BST and a value `key`

, returns the number of nodes having values less than `key`

. Your...

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...

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...

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...

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...

Write a recursive function that increments by one the value for every node in the binary tree pointed at by `root`

, then returns the...

Write a recursive function to count the number of leaf nodes in the binary tree pointed at by `root`

. You must use the `isLeaf`

method to...