One can determine whether a binary tree is a binary search tree by traversing it in is In-order Traversal.
<h3>How do you traverse a binary search tree?</h3><h3>In-order Traversal</h3>
In this traversal method, the left subtree is visited first, then the root and later the right sub-tree. We should always remember that every node may represent a subtree itself. If a binary tree is traversed in-order, the output will produce sorted key values in an ascending order.
As,
In the case of binary search trees (BST), In-order traversal gives nodes in non-decreasing order.
For Inorder, you traverse from the left subtree to the root then to the right subtree.
To get nodes in non-increasing order, Inorder traversal s reversed can be used.
Hence, traversing is Inorder
Learn more about Binary search tree here:
brainly.com/question/12946457
#SPJ4
4.05x+5.25(149-x)=710.25
Solve for x
X=60 ........4.05
149-60=89.....5.25
I think its easier to work out part (c) first:-
People who liked anything except burger = 3/8 + 1/4 + 1/5 = 33/40
So the fraction who liked burgers = 7/40.
7/40 of the total liked burgers so total people surveyed = (40/7) * 126 = 720
ANswer to c is 720.
a) Number who liked chicken and laksa = (3/8 + 1/4) * 720 = 450 Answer
b) Number who liked pasta = 1/5 * 720 = 144
Therefore 144-126 = 18 more people liked pasta than burger , Answer.