Answer:
k < -5
Step-by-step explanation:
5(k+4)<–5
Divide each side by 5
5/5(k+4)<–5/5
k+4 < -1
Subtract 4 from each side
k+4-4 < -1-4
k < -5
The shape of a bst approaches that of a perfectly balanced binary tree, (log2n) is the time complexity for a balanced binary search tree in case of insertions and search.
In computing, binary bushes are mainly used for looking and sorting as they offer a way to save statistics hierarchically. a few common operations that may be conducted on binary trees encompass insertion, deletion, and traversal.
A binary tree has a special situation that each node could have a most of two youngsters. A binary tree has the benefits of each an ordered array and a linked listing as search is as brief as in a taken care of array and insertion or deletion operation are as fast as in related listing.
In pc science, a binary tree is a tree information shape in which every node has at maximum two youngsters, that are known as the left baby and the proper toddler.
Learn more about binary trees here brainly.com/question/16644287
#SPJ4
Answer:
<h3>
B.</h3>
Step-by-step explanation:
The distance between two any points <em>a</em> i <em>b</em> is |a-b| as we don't know which of them is larger number.
So:
a=-2 and b=1 means distance |-2-1| = |-3| = 3
{If we know the value of given points we can subtract the smaller one from the larger. It also works: -2<1, so the distance would be 2-(-1)=2+1=3}
