### - _ -

- _digits : large_number
- _mod : hash_chain

### - a -

- accuracy : machine_learning::adaline
- adj : graph::HKGraph , graph::is_graph_bipartite::Graph
- adjacency_list : graph::Graph< T >
- arr : data_structures::queue_using_array::Queue_Array , data_structures::trie

### - c -

- capacity : MinHeap
- children : data_structures::tree_234::Node
- count : data_structures::tree_234::Node

### - d -

- data : node< Kind >
- dist : graph::HKGraph

### - e -

- eta : machine_learning::adaline

### - f -

- first : data_structures::linked_list::list
- forward : data_structures::Node
- front : data_structures::queue_using_array::Queue_Array

### - h -

- h_heavychlid : range_queries::heavy_light_decomposition::HLD< X >
- h_label : range_queries::heavy_light_decomposition::HLD< X >
- h_parent : range_queries::heavy_light_decomposition::HLD< X >
- harr : MinHeap
- head : hash_chain
- header : data_structures::SkipList
- heap_size : MinHeap

### - i -

- isEndofWord : data_structures::trie
- items : data_structures::tree_234::Node

### - k -

- key : data_structures::Node , double_hashing::Entry , linear_probing::Entry , list , quadratic_probing::Entry

### - l -

- label : range_queries::heavy_light_decomposition::HLD< X >
- last : data_structures::linked_list::list
- left : binary_search_tree< T >::bst_node
- level : data_structures::SkipList , graph::RootedTree

### - m -

- m : graph::HKGraph

### - n -

- n : graph::HKGraph , graph::is_graph_bipartite::Graph
- neighbors : graph::Graph< T >
- next : hash_chain , list , node< Kind >
- NUM_CHARS : data_structures::trie

### - p -

- p : math::ncr_modulo_p::NCRModuloP
- pair_u : graph::HKGraph
- pair_v : graph::HKGraph
- parent : graph::RootedTree
- psucc : data_structures::linked_list::link
- ptrs : range_queries::perSegTree
- pvalue : data_structures::linked_list::link

### - q -

- queueFront : queue< Kind >
- queueRear : queue< Kind >

### - r -

- rear : data_structures::queue_using_array::Queue_Array
- right : binary_search_tree< T >::bst_node , range_queries::perSegTree::Node
- root : graph::RootedTree
- root_ : binary_search_tree< T > , data_structures::tree_234::Tree234

### - s -

- s_size : range_queries::heavy_light_decomposition::SG< X >
- s_tree : range_queries::heavy_light_decomposition::SG< X >
- side : graph::is_graph_bipartite::Graph
- size : stack< Type >
- size_ : binary_search_tree< T >
- sret_init : range_queries::heavy_light_decomposition::SG< X >
- stack : others::postfix_expression::Stack
- stackTop : others::postfix_expression::Stack , stack< Type >

### - t -

- t_adj : range_queries::heavy_light_decomposition::Tree< X >
- t_depth : range_queries::heavy_light_decomposition::Tree< X >
- t_maxlift : range_queries::heavy_light_decomposition::Tree< X >
- t_nodes : range_queries::heavy_light_decomposition::Tree< X >
- t_par : range_queries::heavy_light_decomposition::Tree< X >
- t_root : range_queries::heavy_light_decomposition::Tree< X >
- t_size : range_queries::heavy_light_decomposition::Tree< X >
- t_val : range_queries::heavy_light_decomposition::Tree< X >
- top : tower

### - u -

- up : graph::LowestCommonAncestor

### - v -

- val : range_queries::perSegTree::Node
- value : binary_search_tree< T >::bst_node , data_structures::Node
- values : tower
- vec : range_queries::perSegTree

### - w -

- weights : machine_learning::adaline

### - x -

- x : Point

### - y -

- y : Point