Answer:
userInput = input("Please enter a string of words ")
userInput.split ()
for item in userInput.split ():
if item =="darn":
print("Censored")
break
else:
print(userInput)
Explanation:
Using Python programming language, the input function is used to receive the users input and save in a variable userInput
Then the .split method is used to convert the words into a list of words.
Using a for loop, the code checks for the word darn and prints censored if it exists else it prints the userInput
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:
Classless Inter-Domain Routing
Explanation:
Classless Inter-Domain Routing (CIDR), pronounced “cider” or “sidder,” gets its name from the notion that it ignores the traditional A, B, and C class designations for IPv4 addresses and sets the network-host ID boundary wherever it wants to, in a way that simplifies routing across the resulting IP address spaces.
Answer:
processor, primary storage, secondary storage, input devices and output devices
Explanation:
processor, primary storage, secondary storage, input devices and output devices are the five parts of computer hardware that can be found in most computer systems
Answer:
maybe you do not ask for them i will be your friend.
Explanation:
