This will be stored as a collection of files
Answer:
import java.util.Scanner;
public class DashLine {
public static void main(String[] args) {
// Declaring variables
int n;
/*
* Creating an Scanner class object which is used to get the inputs
* entered by the user
*/
Scanner sc = new Scanner(System.in);
// Getting the input entered by the user
System.out.print("Enter a number :");
n = sc.nextInt();
// calling the method by passing the user entered input as argument
dashedLine(n);
}
//This method will print the dashed line for number greater than zer
private static void dashedLine(int n) {
if (n > 0) {
for (int i = 1; i <= n; i++) {
System.out.print("-");
}
System.out.println();
}
}
}
Explanation:
False, I'm pretty sure people in North Korea cant use it...
A data structure called a binary search tree makes it simple to keep track of a sorted list of numbers.
<h3>What is a binary search tree?</h3>
A binary search tree, also known as an ordered binary tree or a sorted binary tree in computer science, is a rooted binary tree data structure where each internal node's key is higher than all the keys in its left subtree and less than all the keys in its right subtree.
A data structure called a binary search tree makes it simple to keep track of a sorted list of numbers. Because each tree node has a maximum of two offspring, it is known as a binary tree. It can be used to search for the presence of a number in O(log(n)) time.
A binary search tree (BST) is a specific type of binary tree in which every node has a comparable key and a connected or associated value.
To learn more about binary search trees refer to:
brainly.com/question/28295292
#SPJ4
Answer: I think a
Explanation: sorry I’m in wrong, have a great day!! :D
