Chapter 19: Problem 1
The first node in a binary tree is called the __________.
Over 30 million students worldwide already upgrade their learning with Vaia!
All the tools & learning materials you need for study success - in one app.
Get started for free
The three common types of traversal with a binary tree are _________, __________, and __________.
A ternary tree is like a binary tree, except each node in a ternary tree may have three children: a left child, a middle child, and a right child. Write an analogue of the TreeNode declaration that can be used to represent the nodes of a ternary tree.
Give an algorithm for a function int smallest(TreeNode "tree) that takes a pointer to a root of a binary search tree as parameter and returns the smallest value stored in the tree.
Give an algorithm for a function vold Increment (TreeNode "tree) that increments the value in every node of a binary tree by one.
Assume that data is stored in a binary tree, but that unlike in the case of binary search tree, no attempt is made to maintain any sort of order in the data stored. Give an algorithm for a function search that searches a binary tree for a particular value num and returns true or \(\mathrm{false}\) according to whether the value num is found in the tree.
What do you think about this solution?
We value your feedback to improve our textbook solutions.
