+3 votes
E= (a+b)/ [(c*d)-e]
in computer-science by (425 points)
reopened by | 51 views

1 Answer

+3 votes
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 (4.1k points)
Thankyou for solving this question
E= (a+b)/ [(c*d)-e]
532 questions
525 answers
12 users