Write a function which will take a binary tree as input and return the total number of nodesin: the tree. Your code must count the nodes by traversing the tree.a.b. Wite a function which will take a binary tree as input and return the number of totalnumber ef leaves in the tree. Your code must count the leaves by traversing the tree.c. Write code fer building (insertion) a ternary tree. A node (Ternary tree class) in a ternarytree may have at most 3 ehildren. You may need to modify the TreeNode class discussedir. class and adl functions to insert nodes.d. We discussed a methodology to delete a node which has 2 children from BST andin ormally argued avout the correctness of this methodology,An alternative methodology is shown below. The node X has two children, and we wish todelete X. The tree is rearanged as shown in the right after deleting X. Show that thealternative technique also preserves BST property. Write code to implement the alternativetechnique. [20]

C++ program to solve the given problem is below. ****Note: As per Bartleby policy we are allowed…

Answered: a. Write a function which will take a…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

C++ code Write a program to perform following tasks: Given a binary tree of integers, the task is to write in-order tree traversal method that display node’s data if it is even positive number. In all other cases it should display -1. A.Given an array and an integer N, find elements which are divisible by N, using STL Algorithms in C++. B.Given a vector, reverse this vector using STL in C++ without using predefined functions/algorithms. C;Given an integer array containing repeating elements, find number of occurrences of each element using STL map (without using any predefined method) in C++. MUST BE ALL (A.B.C) IN ONE PROGRAM
Q4) Define a recursive function named findDigits : int -> int list such that findDigits returns [] if n is not positive, and returns the list of the digits of n in the order in which they appear in n. # findDigits 3124;; : int list = [3; 1; 2; 4] # findDigits 352663;; : int list = [3; 5; 2; 6; 6; 3]
Write a C++ code, which creates a Doubly Linked List. The code should contain: a) Function which inserts a node in the Doubly Linked List. Use any insertion method. b) Function to find the largest nodes in Doubly Linked List. The code also includes a print function (to print all inserted nodes) and a main function. The code should insert at-least 4 nodes in linked list.
1
Higher-order function foldr: (X Y --> Y) Y ListOfX --> Y Which of the below is true? (select two) A) X and Y must be of different types B) X and Y must be of the same type C) The return type of foldr is a function that takes two arguments D) foldr takes a function as an input argument E) Y can't be a list F) The base case of the implicit recursion is of type Y
1-) Write a function that swaps the contents of a stack and a queue. That is, the function takes the contents of 'stack' and places it in "queue' and the contents of "queue' into 'stack. You may use the stack and queue functions given in the class. Bir kuyruk ile bir stack'in içeriğini yer değiştiren bir fonksiyon yazınız. Sınmfta yazılan kuyruk ve stack fonksyionlarını kullanabilirsiniz. void swapQueueAndStack ( queue *q, stack *s)
Presentation exercise 2 Write a function (including docstring) called multiply_term that takes a polynomial as inputs and a term. We can represent polynomials as a collection or power-coefficient pairs. Consider the following polynomial: p(x) = 2 - a4 – 3. x+ 5. We can represent it as the following collection of pairs: (4, 2), (1, -3), (0, 5). We can represent a term as a tuple where the first value indicated the exponent in the term, and the second its coefficient. For example, the term 5 - a* is represented by the tuple (4, 5). The function does not return anything, but after its execution the input dictionary will now represent the multiplication of the input polynomial by the specified term. For example: Page 2 >> p = {2 : 1, 1 : 2} # x^2 + 2x >>> t = (4, 5) # 5x^4 >>> multiply_term(p, t) >>> p == {6 : 5, 5 10} True You can assume that the function will receive as input a dictionary mapping integers to numbers. No need for you to implement any type of input validation.
17: recursion.cpp) Write two recursive integer functions. The first function should calculate factorials using the definition 0! = 1 and n! = (n-1)! x n. In addition, if n is too large it should be able to detect integer overflow before it happens. The next function should calculate the greatest common factor (gcf) of two numbers. If the second number is zero, then the gcf is the other number. Otherwise, the gcf of a and b is the same as the gcf of b and a mod b.
C++ This a question to create a C string function. Create a function strfind(cs, c) that returns the index of the first occurrence of character c in C string cs. In case c is not found, −1 is returned. Implement the function as efficiently as possible.

Recommended textbooks for you

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

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

SEE MORE TEXTBOOKS