Answer:
The inorder traversal make a binary search tree sorted.
Explanation:
The algorithm of inorder traversal is
1. Traverse the left subtree.
2. print the data .
3. Traverse the right subtree
In this algorithm left subtree is visited first then it print the data or visit the data and finally it visited Right subtree .
Answer: B.you have modified a configuration file to mount these new file system automatically
Explanation:
Hope this helped...~DASH
Answer:
start,stop,step_size
Explanation:
Starting at 5 to for loop will count backward by 1 (hence the step_size being -1) until it reaches 0 (stop).
Answer:
These all are constructors.
<u>CONS</u>
(CONS A B)
makes a pair like this: (A . B)
In other words, A is the CAR of the pair; B is the CDR of the pair.
For example:
(CONS 4 5) ==> (4 . 5)
(CONS 4 '(5 6)) ==> (4 5 6)
[The pair (4 . (5 6)) is the same thing as (4 5 6)].
<u>APPEND </u>
(APPEND A B)
makes a new list by replacing the final nil in A with the list B. A and
B must be proper lists.
For example:
(APPEND '(4) '(5 6)) ==> (4 5 6)
This takes any amount of number and put in this order
<u>LIST </u>
In this ,it will return a list whose elements are value of arguments in the order as it appeared in the LIST.It can take any amount of parameters
For example,
(LIST 4) ==> (4)
(LIST 4 5) ==> (4 5)
(LIST 4 5 '(6 7)) ==> (4 5 (6 7))
(LIST (+ 5 6)(* 5 6)) ==> (8 9)
