Home

Jump to bottom Edit New page

srihari edited this page Jan 31, 2011 · 5 revisions

Data Structures and Algorithms

Binary Trees
Create a Binary Tree first as nodes and references and then as an implicit data structure over an array. Implement the following operations:

Insertion
Iteration
- In order
- Pre order
- Post order
- Depth first traversal
- Breadth first traversal
Query
- Find a key
- Find minimum
- Find maximum
- Predecessor
- Successor

Implement the Huffman Encoding Algorithm since it uses a Binary Tree

Add a custom sidebar

Clone this wiki locally