Lecture - 18 Tries

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
20,414
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Sep 24, 2008

Lecture Series on Data Structures and Algorithms by Dr. Naveen Garg, Department of Computer Science and Engineering ,IIT Delhi. For more details on NPTEL visit http://nptel.iitm.ac.in

Category:

Education

Tags:

License:

Standard YouTube License

Link to this comment:

Share to:

Top Comments

  • Dr. Naveen Garg has become a celebrity

  • This has been by far the best lecture. The class and its pupils involvement made this class even more fun to watch.

    Tries are very useful data structure in these search oriented world. I am glad I came across this lecture.

see all

All Comments (18)

Sign In or Sign Up now to post a comment!
  • I love how the teacher takes his time and explains every single question students have, i wish i had teachers like this...

  • @naderc Its Hindi. I understand, it all should be in English.

  • I do wanted to know my problem for compressed trie.

    1. if sister is a word then my tree contains sister as a 1 node[considering no other node ]

    So how to search for sis[pattern]

  • Great lecture, again wish it was all in English though

  • It was good up until the point where he started speaking p00njabi.

  • @csetech82 Oh sorry, I just guessed. Which language is it? It certainly is not english :)

  • @naderc He does not speak Urdu

  • This is excellent I just wish there were subtitles for when he spoke urdu :)

Loading...
Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more