a) four pointer exchanges b) two pointer exchanges c) one pointer exchanges d) no pointer exchanges.
Home==>makaut-cs-302-data-structure and algorithm==>Page 34
eduhilfe Latest Questions
Sayani saha
Asked: February 23, 2021In: MAKAUT
a) Articulation point b)Sink c) Isolated matrix d) Root vertex.
a) a minimal cost spanning tree of a graph b) a depth first spanning tree of a graph c) a breath first spanning tree of a graph. d) None of these.
Sayani saha
Asked: February 23, 2021In: MAKAUT
a) front=rear+1 b) front=rear-1 c) front=rear d) None of these.
Sayani saha
Asked: February 23, 2021In: MAKAUT
a) b) 2k c) -1 d) None of these.
a) always balanced b) an ordered tree c) a directed tree d) All of these.
Sayani saha
Asked: February 23, 2021In: MAKAUT
a) no pointer b) 1 pointer c) 2 pointer d) 3 pointer.