@gatecse2019
can someone help me understand statement h
18 Sep 2018 - 12:42pm
still not clear with explanation of
h)
18 Sep 2018 - 12:37pm
check your mail id
14 Sep 2018 - 7:41pm
B
LARGEST - CROSS PRODUCT (SXS) N^2
SMALLEST- REFLEXIVE RELATION(ELEMENT FORMING PAIR WITH ITSELF) AND NO OTHER PAIR APART FROM THESE - N
14 Sep 2018 - 7:22pm
today's online class?
14 Sep 2018 - 7:12pm
B
Since there is no mechanism to find a particular element in constant time in sorted array. It can be done in O(logn) using binary search
14 Sep 2018 - 7:10pm
B
inorder along with pre or postorder is neccessary, with only pre and post order we cannot come up with a unique binary tree
14 Sep 2018 - 7:07pm
B
order of traversal
INOORDER - LEFT ROOT RIGHT
PREORDER - ROOT LEFT RIGHT
POSTORDER - LEFT RIGHT ROOT

IN ALL THE THREE TRAVERSALS LEFT IS VISITED BEFORE RIGHT

14 Sep 2018 - 7:04pm

A

inorder- left root right

preorder - root left right

postorder - left right root 

 

from preorder a is tree root

form inorder dbe is to left of [a] and fcg to right of [a]

similarly repeat for left and right subtree and get the binary tree.

and then find its postorder

14 Sep 2018 - 6:24pm
very good quality questions , when are the results going to be announced?
10 Sep 2018 - 10:46pm