C++ How To Program Sve & Mpl W/pe Etx A/c
1st Edition
ISBN: 9780134612386
Author: Deitel
Publisher: Pearson Education
expand_more
expand_more
format_list_bulleted
Question
Chapter 19, Problem 19.19E
Program Plan Intro
Number of Levels that a Binary Tree Has
Program Plan:
1. Construct a tree with a root node, and 4 leaf nodes
2. Find the depth of the left subtree in a recursive manner if the tree is not null
3. Find the depth of the right subtree in a recursive manner if the tree is not null
4. Determine the maximum value of the depths of both subtrees
5. Add 1 to the resulting value for the current node
6. Return depth of the root node to get the number of levels in the given binary tree.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Computer Science
Exercise: depth [★★]
Write a function depth : 'a tree -> int that returns the number of nodes in any longest path from the root to a leaf. For example, the depth of an empty tree (simply Leaf) is 0, and the depth of tree t above is 3. Hint: there is a library function max : 'a -> 'a -> 'a that returns the maximum of any two values of the same type.
please use Ocaml for the coding
java program binary tree:
Given the following binary tree, list all the leaf nodes of this binary tree:
implementation of the Tree function is given below
Chapter 19 Solutions
C++ How To Program Sve & Mpl W/pe Etx A/c
Ch. 19 - Prob. 19.6ECh. 19 - Prob. 19.7ECh. 19 - Prob. 19.8ECh. 19 - Prob. 19.9ECh. 19 - Prob. 19.10ECh. 19 - Prob. 19.11ECh. 19 - (Infix-to-Post fix conversion) Stacks are used by...Ch. 19 - Prob. 19.13ECh. 19 - Prob. 19.14ECh. 19 - Prob. 19.15E
Ch. 19 - Prob. 19.16ECh. 19 - Prob. 19.17ECh. 19 - (Duplicate Elimination) In this chapter, we saw...Ch. 19 - Prob. 19.19ECh. 19 - Prob. 19.20ECh. 19 - Prob. 19.21ECh. 19 - Prob. 19.22ECh. 19 - Prob. 19.23ECh. 19 - Prob. 19.24ECh. 19 - Prob. 19.25ECh. 19 - Prob. 19.26ECh. 19 - Prob. 19.27ECh. 19 - Prob. 19.28E
Knowledge Booster
Similar questions
- 1. Do some research about binary search trees. 2. Create a structure in C for the nodes of this tree. Which variables do the structure have? 3. Write a function that builds a balanced binary search tree. The input argument of this function is a sorted array of integers. 4. Write a recursive function that inserts a new element to the tree. The input argument of this function is a pointer to the head node of the tree. 5. What is the time complexity of this insertion function?arrow_forwardC++ Recall that a "leaf" node in a binary tree is one which has no child nodes, and the height of a tree is the maximum number of edges from its root to one of its leaves). We also saw how easily a binary tree can become poorly structured, where the heights to various leaves in the tree vary dramatically. A full binary tree is one where each node other than the leaf nodes has two child nodes, Write a recursive function which returns true if a binary tree is full, false otherwise. Please avoid the use of variables declared outside of the function.arrow_forward1. Modify the implementation of binary search tree and add a function to count the number of leaf nodes. 2. Modify the implementation of binary search tree and add a function to calculate the height of the tree. Run this project in C++.arrow_forward
- C++ please add comments so I understand Write a program that takes n elements as input and inserts them into a binary tree. Include a function to print out the elements in the tree. Please do not use header files - just one simple program that I can understand.arrow_forwardGiven a number and a sorted binary tree, write function that inserts the number into the tree. Given a list of numbers, write a function that inserts each number into the tree. Given a sorted tree, write a function that creates a sorted list.arrow_forwardWrite a C++ code to insert the following information in the Binary Search Tree: {Paris, London, Dubai, Muscat, Riyadh, Berlin, Amsterdam, Sydney, Stockholm, Oslo} After insertion, print all names of binary search tree using cout statement.arrow_forward
- write a python function that will return the leaves of a binary tree with (t) being the root of the binary tree. the function must use recursion Starting code: def leaves(t): return [t.key]arrow_forward(6) Create an ordered, rooted tree that represents the infix form of the following equation. Then write out the prefix form of the equation. ((X*Y) + (Y * ((X+5) * (Y+7))))/3arrow_forwardC++, Write a recursion function that counts the positive elements multiple of 5 in a binary search tree and counts the elements less than 0 and multiple of 2, then returns the two counts multiplied to the main.Note that you have to write only one function and you can add parameters to the function as neededarrow_forward
- - Write a Java code that finds if two given nodes in a general tree are siblings or not for the list of children implementation, linked implementation left-child/right-sibling. - Write a Java code that remove next sibling in a general tree for the linked implementation using array of child pointers, array implementation left-child/right-sibling.arrow_forwardDear Sir, Please read the question carefully, and answer it with an explanation. Question: Write a C++ program of the Red-Black tree, that has the following Functions. Functions: 1. Insertion: Insert at least 8 values in a Red-Black tree. 2. Deletion: Delete 3 different nodes from the Red-Black tree you have created above. Make sure, after the deletion, the remaining tree must be a Red-Black tree. 3. Searching: Search a specific value in a Red-Black tree.arrow_forwardPerform the given task. Treearrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education