Question: Which of the following functions returns the second smallest node in a binary search tree r ? find _ smallest ( tree _ node *

Which of the following functions returns the second smallest node in a binary search tree r? find_smallest(tree_node* r) function returns the node with smallest value in a tree r. If tree r is empty find_smallest returns NULL.
tree_node* find_second_smallest(tree_node* r){
if (r->left==NULL) return find_smallest(r->right);
tree_node *p = find_second_smallest(r->left);
if (p==NULL) return r;
else return p;
}
tree_node* find_second_smallest(tree_node* r){
if (r->left==NULL) return find_smallest(r->right);
return find_second_smallest(r->left);
}
tree_node* find_second_smallest(tree_node* r){
if (r->left==NULL) return find_smallest(r->right);
tree_node *p = find_second_smallest(r->left);
if (p!=NULL) return r;
else return p;
}
tree_node* find_second_smallest(tree_node* r){
tree_node *p = find_second_smallest(r->left);
if (p!=NULL) return r;
else return p;
}

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Finance Questions!

Q:

Write an algorithm that returns the second largest value for a binary search tree containing at least two nodes. Assume the binary search tree does not allow duplicates. Give the time complexity of...

Q:

In this laboratory assignment, you will write an OCaml function that deletes a node from a binary search tree (BST). so it is assumed that you are familiar with the BST deletion algorithm. We will...

Q:

Main.c is provided: #include "bst.h" #include "stdio.h" #include "stdlib.h" #include "time.h" void inputTest(); void heightExperiments(); int minV(int *A, int size); int maxV(int *A, int size); int...

Q:

Python 3 1. The class BST describes a node in a binary search tree. Trace the execution of the following program that builds a binary search tree. class BST (object): # Constructor def init..(self,...

Q:

Data Structures in JAVA questions Multiple Choice For each question, select the best answers that apply. More than one answer can be circled and D is always going to be None of the above. This means...

Q:

Main.c is provided: #include "bst.h" #include "stdio.h" #include "stdlib.h" #include "time.h" void inputTest(); void heightExperiments(); int minV(int *A, int size); int maxV(int *A, int size); int...

Q:

Please in C language not C++ or c# All of the requirements are considered under one question, so all of them pls to thumb up or don't solve it. Write a C program that follows these requirements: 1....

Q:

In C language not C++ or C#, please stick with requirements, thanks! Write a C program that follows these requirements: 1. Declare a struct Node for the Binary Search Tree. The node should have three...

Q:

( python ) # Hw 6 BST: Implement a Node class for Binary Search Tree class Node: def _ _ init _ _ ( self , value, left = None, right = None ) : self.value = value self.left = left self.right = right...

Q:

modify GolfApp2 by writing a client method that returns a reference to the information in the node with the "smallest" value in a binary search tree. The signature of the method is Golfer...

Q:

Indicate some sources that contain a dividend record of payments.

Q:

What factors make the southern region of the United States an attractive location for service and manufacturing businesses?

Q:

One disadvantage of buying stock in a corporation is that the distant stockholder - owners of a corporation can be held personally responsible for the debts of , or lawsuit judgments against the...

Q:

QUESTION 1 The Barotse Water and Sewerage Company has a K2, 000,000 fixed-cost contract to install 1,000 new pre-paid water meters. The contract calls for removing old water meters from residential...