All categories

3 years ago

What will be the index of leaf node in a right-skewd binary tree with height =7,where every parent has at most one child?

Computers and Technology

1 answer:

Delvig [45]3 years ago

3 0

Answer:

There are 2 leaf nodes in the given binary tree.

Explanation:

A tree stores the elements in the form of a hierarchal structure. The first node which has children is called the root of the tree. And the nodes with no children are called leaf nodes.

In the given diagram, we can see that all nodes have children except C and D so C and D are leaf nodes.

Hence,

There are 2 leaf nodes in the given binary tree.

You might be interested in

To calculate the chapter from which you must solve the programming exercise, divide the integer number representing your student

Mashutka [201]

Answer:

import java.util.Scanner;

public class ANot {

public static void main(String[] args) {

System.out.println("Please Enter Your Student ID");

Scanner in = new Scanner(System.in);

int yourId = in.nextInt();

int chapterToRead = (yourId%3)+3;

System.out.println("You are to read chapter: "+chapterToRead);

}

}

Explanation:

This solution is implemented in Java programming language. The scanner class is used to receive user input which is saved in an int variable yourId. In order to obtain the remainder when the students' ID is divided by 3, we use the modulo (%) operator which returns the remainder

7 0

3 years ago

Ou have just set up a network that will use the tcp/ip protocol, and you want client computers to obtain ip configuration automa

Aleks [24]

DHCP (Dynamic Host Configuration Protocol)

5 0

2 years ago

A terrible new disease, HORSEVID, has begun to spread among horses worldwide. Stable manager Jimmy is trying to take as many pre

tresset_1 [31]

Answer:

Explanation:

Well here you only have to add 2 new horses .... so simply what you can do is find 2 slots where the gap is maximum ... lets take the given example in detail to understand the same.... here 10001001000010 here you can observe that the difference between the first two filled slots is 3 then 2 then 4 then 1....... make it a separate array ...... now as i said that we just need to place two new horses so we just need two of the biggest numbers from this array and place the new horses at the center of the corresponding slots ... like here 3 and 4 are greatest ... so one horse is placed in between the gap corresponding to 3 while other at 4 ..... after making the new array answer can be find in linear time itself... I hope this makes sense ....

Now lets understand how to program it easily so firstly after scanning all stuff ..... we will make a gap array .... then just think now what we will do is find the greatest two numbers then again putting the horses and then find our answers .... so now an easy approach is that instead of making the string again and again searching for answer .... what we do is just do half of the two greatest ones and again find the greatest one in array....

6 0

3 years ago

Find the equation of a line which has 10 points the following two coordinates: (4, 0) and (3, 4)

alex41 [277]

Answer:

The equation of the line is y = -4·x + 16

10 points on the line include;

(0, 16), (1, 12), (2, 8), (3, 4), (4, 0), (5, -4), (6, -8), (7, 12), (8, -16), (9, -20), and (10, -24)

Explanation:

The given points through which the line passes are;

(4, 0) and (3, 4)

The slope, 'm', of the line is given as follows;

$Slope, \, m =\dfrac{y_{2}-y_{1}}{x_{2}-x_{1}}$

Therefore, the slope of the line is (4 - 0)/(3 - 4) = -4

In point and slope form we can get;

$\dfrac{y-0}{x-4} = -4$

The equation of the line in point and slope form is therefore;

y = -4·(x - 4) = -4·x + 16

The equation of the line in slope and intercept form is

y = -4·x + 16

10 points on the line are obtained using the equation of the line and the desired x-values input into cells on MS Excel and presented here as follows;

(0, 16), (1, 12), (2, 8), (3, 4), (4, 0), (5, -4), (6, -8), (7, 12), (8, -16), (9, -20), and (10, -24)

8 0

2 years ago

Write C++ code to open a document with the name Hello.txt, place the message "Hello, World!" in the document, and exit the docum

gavmur [86]

Answer:

#include<iostream>

#include<fstream>

using namespace std;

int main()

{

ofstream out;

out.open("Hello.txt");

out << "Hello, World!"<< endl;

out.close();

ifstream in;

in.open("Hello.txt");

while(in.good()){

string line;

in >> line;

cout << line << endl;

}

in.close();

return 0;

}

Explanation:

Step 1:

Add all your preprocessor files directive, #include is known as the preprocessor is used to load files needed to run the code.

#include<iostream>: it provides basic input and output services for C++ programs.

#include<fstream>:used to open a file for writing and reading

using namespace std; means you'll be using namespace std means that you are going to use classes or functions (if any) from "std" namespace

Step 2:

ofstream out; his is used to create files and write data to the file

out.open("Hello.txt"); a new file "HELLO.txt" has been created

out << "Hello, World!"<< endl; "Hello World!" has now been writen to the file

out.close(); The file is now closed

This second step opens a new file and writes hello world to the file then closes it.

Step 3:

ifstream in; ifstream in c++ is a stream class which stands for input file stream a is used for reading data from file.

in.open("Hello.txt"); Reopens the file without recreating it. This is a very important step because if not done properly, you might discard the file you previously created and recreate it.

while(in.good()){

in.good() is true if the previous read operation succeeded without EOF being encountered

string line; It declares a string variable line

in >> line; reads the data into the line variable

cout << line << endl; Prints out the line

reopens the file and read the message into a string variable "line". prints out line then exits out of the file.

5 0

3 years ago

What will be the index of leaf node in a right-skewd binary tree with height =7,where every parent has at most one child?​

What will be the index of leaf node in a right-skewd binary tree with height =7,where every parent has at most one child?