Java Programming Tree Traversals (Inorder, Preorder and Postorder) – Tree – Unlike linear data structures (Array, Linked List, Queues, Stacks, etc) which
JAVA
113 Articles
113
Java Algorithm – Write a function that counts the number of times a given int occurs in a Linked List – Linked List – Given a singly linked list and a key
Java Programming – Bellman–Ford Algorithm – Dynamic Programming Given a graph and a source vertex src in graph, find shortest paths from src to all vertices
Java Program – Find the node with minimum value in a Binary Search Tree – Just traverse the node from root to left recursively until left is NULL.
Java Algorithm – Implement two stacks in an array – Data Structure – Create a data structure twoStacks that represents two stacks.
Java Programming – Write a function to get Nth node in a Linked List – Linked List – Write a GetNth() function that takes a linked list and an integer index
Java Algorithm – Search an element in a Linked List both Iterative and Recursive – Linked List – Write a C function that searches a given key ‘x’ in a given
Java Programming – Binary Tree (Introduction) – A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree
Java Algorithm – Find Length of a Linked List both Iterative and Recursive – Linked List – Write a C function to count number of nodes in a given singly
queue data structure introduction array implementation Like Stack, Queue is a linear structure which follows a particular order in which the operations