Hi,
the program is as follows
___________________________________________________________
import java.io.*;
class doubleval
{
public static void main()throws IOException
{
DataInputStream dt=new DataInputStream(System.in);
System.out.println("Enter NUMBER WHOSE DOUBLE U WANT TO PRINT");
int n=Integer.parseInt(dt.readLine());
for(int i=n;i<=100;i=2*i)
{
System.out.println(i);
}
}
}
Answer:
A Red Black Tree is a type of self-balancing(BST) in this tree ,each node is red or black colored. The red black tree meets all the properties of the binary search tree, but some additional properties have been added to a Red Black Tree.
A Red-Black tree's height is O(Logn) where (n is the tree's amount of nodes).
In a red-black tree with black height k
The maximum number of internal nodes is 
.
The smallest possible number is 
.
Answer:
computer file is a computer resource for recording data discretely in a computer storage device. Just as words can be written to paper, so can information be written to a computer file. Files can be edited and transferred through the internet on that particular computer system.
The answer would be A: wireframe, im pretty sure...
Hope this helped!! :)
