58) An item that is read as input can be either pushed to a stack and later popped and printed, or printed directly. Which of the following will be the output if the input is the sequence of items 1, 2, 3, 4, 5?

3, 4, 5, 1, 2

3, 4, 5, 2, 1

1, 5, 2, 3, 4

5, 4, 3, 1, 2

Answer is:

3, 4, 5, 2, 1

Every tree is a bipartite graph

A tree contains a cycle

A tree with n nodes contains n-1 edges

A tree is a connected graph

Answer is:

It is an m-ary tree

Successful searches should terminate in leaf nodes

Unsuccessful searches may terminate in leaf nodes level of the tree structure

All of these

Answer is:

Full binary tree

Binary Search Tree

Threaded tree

Complete binary tree

Answer is:

binary search tree

Binary Tree

Completely balanced tree

Heap

Answer is: