If binary tree is empty, create a node, and assign data, point to itOtherwise : point to root node Compare the new – data – to – insert with the current node dataWe maintain a pointer say current to point to the node under visit If data matched : nothing to doIf data does not …
Category: ব্লগ । Blog
ব্লগ । Blog
Jul 28
Steps to Search in a Hash Table Built Using Graph: Chaining
•Search the Hash •Read a number/word •From the user •Find the position for this number/word •in the graph (vertical array of nodes) •By dividing with N or similar •Check if any vertex node is there •In that array position (array of graph vertices) •If no vertex is there •The word is not in the hash …
Jul 28
Steps to Build a Hash Table: Using Graph: Chaining
•Build the Hash •Read a number/word from file •Find the position for this number/word •in the graph (vertical array of nodes) •By dividing with N or similar •Check if any vertex node is there •In that array position (array of graph vertices) •If no vertex is there •Create a vertex node, assign the number/word to …
