Interested to Buy Any Domain ? << Click Here >> for more details...
How is it possible to insert different type of elements in
stack?
- 7 Answers
- 34027 Views
- TCS, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / poornakala
you ca implement stack with union datatype... u may think
of structures.. but struct use storin of all values and mem
allocated for all in each.. but in union only one at a
time... this is right i think...
| Is This Answer Correct ? | 61 Yes | 9 No |
Answer / rabia altaf
we can make stack using class template .. now it can accept
every type of object ..
| Is This Answer Correct ? | 19 Yes | 5 No |
Answer / krishan
We can use a struct containing "void * " in it and an
unsigned int to store the datatype which "void *" will store
(can be set at time of storing the value). To store a value
of any type we can dynamically allocate the space and set
the unsigned int to some pre-determined constants. Like
1 for int type.
2 for char.
3 for char string.
4 for any other type. say some user datatype.
| Is This Answer Correct ? | 21 Yes | 12 No |
Answer / sudipto ghosh
yes it is possible to insert different types of element in a
stack.
insted of defining the member as int or float or so on. we
will define each element as a union which will be consisting
of all types of data type and only one can be used at a
time. in order to determine which type of element is being
pushed or poped we will define a flag with in union which
keeps the track of data type being used.
| Is This Answer Correct ? | 11 Yes | 3 No |
Answer / devendra
union is the best option because it allocate only one at a time
| Is This Answer Correct ? | 6 Yes | 2 No |
Stack can be described as a pointer. Explain.
What are different types of sorting algorithms?
What is a B tree?
0 Answers Akamai Technologies,
If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?
What is the space complexity of bubble sort?
What is the prerequisite for binary searching?
Describe the height term in a tree.
How does a dynamic array work?
Why do we use collections?
What is huffman’s algorithm?
Is a hashset ordered?
Is hashset synchronized?
Windows 
