anonymous
  • anonymous
Let A = {a, b, c, d, e, f, g, h} Relation R = {(a, b), (a, c), (a, d), (c, h), (d, e), (e, f), (f, g)} a. Draw the tree for the relation R b. Find the root of the tree for the relation R c. List all the leaves of the rooted tree for R
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
chestercat
  • chestercat
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
AravindG
  • AravindG
can you tel me what difficulty you have in this question?
anonymous
  • anonymous
I want to check the answer how to draw
anonymous
  • anonymous
|dw:1356334692932:dw|

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

hartnn
  • hartnn
thats a correct tree u have drawn...
hartnn
  • hartnn
know what root means ?
anonymous
  • anonymous
thanks~
anonymous
  • anonymous
nope, how many root inside there?
hartnn
  • hartnn
There is only one root of any tree, which is the topmost element.
anonymous
  • anonymous
root for b, c, d is a root for h is c root for e is d root for f is e root for g is f
hartnn
  • hartnn
what you are listing is parents! not root. parent for b, c, d is a parent for h is c and so on. A tree has only 1 root, which has no parent.
hartnn
  • hartnn
should i give an example ? or u got it ?
anonymous
  • anonymous
opps~ic
anonymous
  • anonymous
all right! I get it already, u means a is the only root?
hartnn
  • hartnn
exactly!
hartnn
  • hartnn
u know what leaves are ?
anonymous
  • anonymous
b, h, g
hartnn
  • hartnn
bingo! thats correct :)
queelius
  • queelius
Technically, it's not the top most node, it's the node with no edges coming into it (indegree(root) = 0).
hartnn
  • hartnn
yeah, thats a textbook definition...
anonymous
  • anonymous
10Q so much guys for your great explanation :)
hartnn
  • hartnn
whalecum ^_^

Looking for something else?

Not the answer you are looking for? Search for more explanations.