Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
4th Edition
ISBN: 9780134787961
Author: Tony Gaddis, Godfrey Muganda
Publisher: PEARSON
Expert Solution & Answer
Book Icon
Chapter 21, Problem 5AW

Explanation of Solution

Algorithm for a method “contains” to search a value of “x”:

Step 1: Define the method name “contains ()” which contains the node and search element as the parameters.

Step 2: Check if the value of node is equal to null. If it is equal, then return “false”.

Step 3: Check if the value of node is equal to the search element. If this condition is true, then return “true”.

Step 4: Again check if the search element is present in the left side of the tree by calling the function “contains ()” recursively and return “true” if the search element is present.

Step 5: Again check if the search element is present in the right side of the tree by calling the function “contains ()” recursively and return “true” if the search element is present.

Step 6: Finally, if the search element is not present, then return “false”.

A method “contains” to search a value of “x”:

//Function definition for "contains"

boolean contains(Node binarytree, int x)

{

    //Check if the value of node is equal to null

    if (binarytree == null)

        //Return false

        return false;

//Check if the value of node is equal to the search element

    if (binarytree.value == x)

        //Return true

        return true;

//Check if the search element is present in the left sub-tree

    if (contains(binarytree...

Blurred answer
Students have asked these similar questions
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 false according to whether the value num is found in the tree.
Create a binary linked tree, and traverse the tree by using the recursive function. The structure of the tree is as follow:   You should input the nodes in pre-order sequence. If a child of a node is NULL, input a space. Write the function of create binary tree, pre-order to print the nodes, in-order to print the nodes and post-order to print the nodes. Count the height of the tree.   Header file typedef char ElemType;   typedef struct node//define the type of binary tree node {                                       }BTnode;       Source file #include <stdio.h> #include <stdlib.h> #include "tree.h"   BTnode * createTree()//create the binary tree,return the root {             BTnode *tnode;// tnode is the root             char elem;                                ;//input the character                            //if the input is a space,set the pointer as NULL               Else// if the input is not a space,generate the binary node and create its left sub-tree and right…
Create a binary search tree B₁ by inserting the numbers 1, 2, 3, ... n into an empty binary search tree. Create another binary search tree B2 by inserting the numbers into an empty binary search tree in the reverse order. What is the difference between the right-most element of B₁ and the left-most element of B2?
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education