package com.test.ds; import java.util.*; public class LinkedListTest { public static void main(String[] arg){ CLinkedList clist = new CLinkedList(); clist.addFirst(1); clist.addFirst(2); clis… more →
Chaitanya's Blogvchaithanya wrote 1 year ago: package com.test.ds; import java.util.*; public class LinkedListTest { public static void main(Stri … more →
vchaithanya wrote 1 year ago: package com.test.ds; public class CLinkedList { Node head; CLinkedList(){ } public void addLast( … more →
vchaithanya wrote 1 year ago: //depth of a binary Tree /* int depth(Root T) { if(T == NULL) return 0; d1 = depth(T -> left); d2 … more →
vchaithanya wrote 1 year ago: The following is one of the cool book to get basic idea of how to implement LinkedList, Trees in jav … more →
jafferym wrote 1 year ago: If you are like me, and hate datastructures and the terms that are used in programming. Well, here … more →
Kiran Mova wrote 2 years ago: For large datasets, which option would work better in terms of memory consumption and performance? … more →