+2 votes
2.8k views
in Operating System by (8.1k points)
reopened
E= (a+b)/ [(c*d)-e]

1 Answer

+3 votes
by
selected
 
Best answer

Binary tree is a finite set of elements called nodes such that is

It may be empty or it is partitioned into three disjoint subsets there is a single distinguished element called the root of tree others two subsets are binary tree called left subtree and right subtree

E= (a+b)/ [(c*d)-e]

by (8.1k points)
edited
Thankyou for solving this question
E= (a+b)/ [(c*d)-e]

Related questions

Doubtly is an online community for engineering students, offering:

  • Free viva questions PDFs
  • Previous year question papers (PYQs)
  • Academic doubt solutions
  • Expert-guided solutions

Get the pro version for free by logging in!

5.7k questions

5.1k answers

108 comments

563 users

...