<divclass="line"><aname="l00005"></a><spanclass="lineno"> 5</span> <spanclass="comment"> The dictionary prepares space for 1000 elements.</span></div>
<divclass="line"><aname="l00014"></a><spanclass="lineno"> 14</span> <spanclass="comment"> special data type called 'Dictionary'</span></div>
<divclass="line"><aname="l00015"></a><spanclass="lineno"> 15</span> <spanclass="comment"> for generic use</span></div>
<divclass="line"><aname="l00020"></a><spanclass="lineno"> 20</span> <spanclass="comment"> void* array for generic use of the dictionary.</span></div>
<divclass="line"><aname="l00021"></a><spanclass="lineno"> 21</span> <spanclass="comment"> there actual saves the entries.</span></div>
<divclass="line"><aname="l00025"></a><spanclass="lineno"> 25</span> <spanclass="comment">/* contains the number of elements in this dictionary */</span></div>
<divclass="line"><aname="l00031"></a><spanclass="lineno"> 31</span> <spanclass="comment"> create_dict: is a simple constructor for creating</span></div>
<divclass="line"><aname="l00032"></a><spanclass="lineno"> 32</span> <spanclass="comment"> a dictionary and setting up the</span></div>
<divclass="line"><aname="l00033"></a><spanclass="lineno"> 33</span> <spanclass="comment"> member field 'number_of_elements'</span></div>
<divclass="line"><aname="l00034"></a><spanclass="lineno"> 34</span> <spanclass="comment"> and prepares the inner array 'elements'</span></div>
<divclass="line"><aname="l00039"></a><spanclass="lineno"> 39</span> <spanclass="comment"> add_item_label: adds item (void*) to the dictionary at given label</span></div>
<divclass="line"><aname="l00040"></a><spanclass="lineno"> 40</span> <spanclass="comment"> returns 0 if adding was sucessful otherwise -1</span></div>
<divclass="line"><aname="l00045"></a><spanclass="lineno"> 45</span> <spanclass="comment"> add_item_index: adds item (void*) to the dictionary at given index (int)</span></div>
<divclass="line"><aname="l00046"></a><spanclass="lineno"> 46</span> <spanclass="comment"> returns 0 if adding was sucessful otherwise -1</span></div>
<divclass="line"><aname="l00051"></a><spanclass="lineno"> 51</span> <spanclass="comment"> get_element: returns the element at given label</span></div>
<divclass="line"><aname="l00056"></a><spanclass="lineno"> 56</span> <spanclass="comment"> get_element: returns the element at given index</span></div>
<divclass="ttc"id="athreaded__binary__trees_8c_html_a284d683f74b6c884e79ba00d3d1c3317"><divclass="ttname"><ahref="../../df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317">delete_bt</a></div><divclass="ttdeci">void delete_bt(node **root, int ele)</div><divclass="ttdoc">deletion of a node from the tree if the node isn't present in the tree, it takes no action.</div><divclass="ttdef"><b>Definition:</b> threaded_binary_trees.c:173</div></div>
<divclass="ttc"id="astruct_node_html_a87c003c9f600e3fc58e6e90835f0b605"><divclass="ttname"><ahref="../../db/d8b/struct_node.html#a87c003c9f600e3fc58e6e90835f0b605">Node::data</a></div><divclass="ttdeci">int data</div><divclass="ttdoc">stores the number</div><divclass="ttdef"><b>Definition:</b> threaded_binary_trees.c:28</div></div>
<divclass="ttc"id="astruct_node_html_a0ed3c7305b43527f0f237bbfd438b8f7"><divclass="ttname"><ahref="../../db/d8b/struct_node.html#a0ed3c7305b43527f0f237bbfd438b8f7">Node::rlink</a></div><divclass="ttdeci">struct Node * rlink</div><divclass="ttdoc">link to right child</div><divclass="ttdef"><b>Definition:</b> threaded_binary_trees.c:30</div></div>
<divclass="ttc"id="astruct_node_html"><divclass="ttname"><ahref="../../db/d8b/struct_node.html">Node</a></div><divclass="ttdoc">Node, the basic data structure of the tree.</div><divclass="ttdef"><b>Definition:</b> threaded_binary_trees.c:27</div></div>
<divclass="ttc"id="athreaded__binary__trees_8c_html_a5a82ae0ee13788be51ca4ba6cddb0719"><divclass="ttname"><ahref="../../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719">postorder_display</a></div><divclass="ttdeci">void postorder_display(node *curr)</div><divclass="ttdoc">performs postorder traversal param[in] curr node pointer to the topmost node of the tree</div><divclass="ttdef"><b>Definition:</b> threaded_binary_trees.c:143</div></div>
<divclass="ttc"id="athreaded__binary__trees_8c_html_ad8ecdcce462dd8e170ae1f164935aaa6"><divclass="ttname"><ahref="../../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6">node</a></div><divclass="ttdeci">struct Node node</div><divclass="ttdoc">Node, the basic data structure of the tree.</div></div>
<divclass="ttc"id="athreaded__binary__trees_8c_html_a306d567466f22e1e927aaed97d8bb58c"><divclass="ttname"><ahref="../../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c">search</a></div><divclass="ttdeci">void search(node *root, int ele)</div><divclass="ttdoc">searches for the element</div><divclass="ttdef"><b>Definition:</b> threaded_binary_trees.c:98</div></div>
<divclass="ttc"id="astruct_node_html_a60b73f452505cef98795d2c8de3e72ef"><divclass="ttname"><ahref="../../db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef">Node::llink</a></div><divclass="ttdeci">struct Node * llink</div><divclass="ttdoc">link to left child</div><divclass="ttdef"><b>Definition:</b> threaded_binary_trees.c:29</div></div>
<divclass="ttc"id="athreaded__binary__trees_8c_html_a8169ba0dfd5b8183672e444d1434bf9c"><divclass="ttname"><ahref="../../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c">preorder_display</a></div><divclass="ttdeci">void preorder_display(node *curr)</div><divclass="ttdoc">performs preorder traversal param[in] curr node pointer to the topmost node of the tree</div><divclass="ttdef"><b>Definition:</b> threaded_binary_trees.c:157</div></div>
<divclass="ttc"id="ac__atoi__str__to__integer_8c_html_a3c04138a5bfe5d72780bb7e82a18e627"><divclass="ttname"><ahref="../../d7/dd8/c__atoi__str__to__integer_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><divclass="ttdeci">int main(int argc, char **argv)</div><divclass="ttdoc">the main function take one argument of type char* example : .</div><divclass="ttdef"><b>Definition:</b> c_atoi_str_to_integer.c:72</div></div>
<divclass="ttc"id="athreaded__binary__trees_8c_html_a4c1e06b5f0876ec9c1bd6817f3b7eda7"><divclass="ttname"><ahref="../../df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7">inorder_display</a></div><divclass="ttdeci">void inorder_display(node *curr)</div><divclass="ttdoc">performs inorder traversal param[in] curr node pointer to the topmost node of the tree</div><divclass="ttdef"><b>Definition:</b> threaded_binary_trees.c:129</div></div>
<divclass="ttc"id="athreaded__binary__trees_8c_html_ab21d1d36d95001defbca2f6abd4d410c"><divclass="ttname"><ahref="../../df/d3c/threaded__binary__trees_8c.html#ab21d1d36d95001defbca2f6abd4d410c">create_node</a></div><divclass="ttdeci">node * create_node(int data)</div><divclass="ttdoc">creates a new node param[in] data value to be inserted</div><divclass="ttdef"><b>Definition:</b> threaded_binary_trees.c:38</div></div>
<divclass="ttc"id="akohonen__som__topology_8c_html_affe776513b24d84b39af8ab0930fef7f"><divclass="ttname"><ahref="../../d2/df6/kohonen__som__topology_8c.html#affe776513b24d84b39af8ab0930fef7f">max</a></div><divclass="ttdeci">#define max(a, b)</div><divclass="ttdoc">shorthand for maximum value</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:32</div></div>
<divclass="ttc"id="athreaded__binary__trees_8c_html_a823432888332fc9f0aa6072cff28c3bb"><divclass="ttname"><ahref="../../df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb">insert_bt</a></div><divclass="ttdeci">void insert_bt(node **root, int data)</div><divclass="ttdoc">inserts a node into the tree param[in,out] root pointer to node pointer to the topmost node of the tr...</div><divclass="ttdef"><b>Definition:</b> threaded_binary_trees.c:51</div></div>
