Binary Tree Basics

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 then return the modified tree. Assume that...

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

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

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

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

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 int BTleaf(BinNode root) to count the number of leaf nodes in the binary tree pointed at by root. You must use...

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

Given two binary trees, return true if and only if they are structurally identical (they have the same shape, but their nodes can have...