Engineering

Computer Programming

C Programming

# Practical application of red black tree of data structure?

###### Wiki User

###### October 03, 2009 6:20PM

Red Black Tree is a special type of self balancing binary search tree. This is used as Syntax Trees in major compilers and as implementations of Sorted Dictionary.

## Related Questions

###### Asked in Computer Programming, Database Programming, Java Programming, C Programming

### Application of stack in data structure?

One way to emulate a stack with a data structure is with a
singly linked list wherein you can only add and remove nodes from
the head or tail of the list (depending on implementation). An easy
and straightforward application of this type of data structure
would be a reverse polish notation calculator where values can be
pushed onto the data structure and then popped when one comes
across an arithmetic symbol.