Skip to content
#

tries

Here are 75 public repositories matching this topic...

The tree data structure is a versatile object ; This offering offers the Trie tree - And Binary tree - Data tree. Information can be save at nodes of the tree Trees can be Printed to Tree-view Control / Function Insert / Find Prefix / Find Word a Start Character is used and Stop Character is used. the Trie tree Can store Characters as nodes; Used for Faster String matching! The binary is numerical addressing ; given a numerical value / find the node in the tree to store the value; Sentences can be added to the Search Tree; As well as finding prefixes and suffixes of sentences in the trie

  • Updated Jul 1, 2018
  • Visual Basic

These are some of the codes I have written in C++. I have done the implementation of many data structures - Trees(Binary + BST + Generic), Hashmaps(problems + implementation), Tries, Graphs, some popular algorithms(Dijkstra's, Prim's..), PriorityQueues(implementation + problems), some codes relating to OOPS as well.

  • Updated Apr 7, 2019
  • C++

This repository contains the implementation of Data Structures - LinkedList, Heaps, Trees and Stacks and several important Algorithms - Searching, Sorting, Recursion, Binary Search Trees, Graph Algorithms, Dynamic Programming from scratch in Java.

  • Updated Feb 22, 2018
  • Java

Improve this page

Add a description, image, and links to the tries topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the tries topic, visit your repo's landing page and select "manage topics."

Learn more

You can’t perform that action at this time.