Chapter 19: Problem 3
A node with no children is called a(n) __________.
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 first node in a binary tree is called the __________.
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.
Suppose the following values are inserted into a binary search tree, in the order given: \\[12,7,9,10,22,24,30,18,3,14,20\\] Draw a diagram of the resulting binary tree.
The three common types of traversal with a binary tree are _________, __________, and __________.
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.
