Data Structure
Trie (Prefix tree, digital tree, radix tree):
A trie is an ordered search tree usually used to store a dynamic set consisting of strings. A node is associated with a key and the root is associated with the empty string.
A binary tree is made up of at most two nodes, often called the left and right nodes, and a data element. The topmost node of the tree is called the root node, and the left and right pointers direct to smaller subtrees on either side. Binary trees are used to implement binary search trees and binary heaps. They are also often used for sorting data as in a heap sort.
A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph.
Some examples use data structure to solve the real questions.