Name		Name	Last commit message	Last commit date
Latest commit History 96 Commits
Assignment Recursion		Assignment Recursion
LinkedList-1		LinkedList-1
LinkedList-2		LinkedList-2
OOPS-1		OOPS-1
Queue		Queue
Recursion-1		Recursion-1
Recursion-2		Recursion-2
Stacks		Stacks
Test4		Test4
Test5		Test5
Test6		Test6
BST1-BST to LL		BST1-BST to LL
BST1-Construct BST		BST1-Construct BST
BST1-Elements Between K1 and K2		BST1-Elements Between K1 and K2
BST1-LCA of BST		BST1-LCA of BST
BST1-Replace with Sum of greater nodes		BST1-Replace with Sum of greater nodes
BST1-Search In BST		BST1-Search In BST
BST2-BST Class		BST2-BST Class
BST2-Find path in BST		BST2-Find path in BST
BST2-Largest BST		BST2-Largest BST
BST2-Level wise linkedlist		BST2-Level wise linkedlist
BST2-Pair sum in a BST		BST2-Pair sum in a BST
Binary Trees1-Height Of Tree		Binary Trees1-Height Of Tree
Binary Trees1-Is Node Present		Binary Trees1-Is Node Present
Binary Trees1-Nodes Greater Than X		Binary Trees1-Nodes Greater Than X
Binary Trees1-Nodes without sibling		Binary Trees1-Nodes without sibling
Binary Trees1-Postorder Binary Tree		Binary Trees1-Postorder Binary Tree
Binary Trees1-Preorder Binary Tree		Binary Trees1-Preorder Binary Tree
Binary Trees1-Replace Node With Depth		Binary Trees1-Replace Node With Depth
Binary Trees1-Sum Of Nodes		Binary Trees1-Sum Of Nodes
Binary Trees2-Construct Tree Using Inorder and PostOrder		Binary Trees2-Construct Tree Using Inorder and PostOrder
Binary Trees2-Construct Tree Using Inorder and Preorder		Binary Trees2-Construct Tree Using Inorder and Preorder
Binary Trees2-Create & Insert Duplicate Node		Binary Trees2-Create & Insert Duplicate Node
Binary Trees2-Diameter Of Binary Tree		Binary Trees2-Diameter Of Binary Tree
Binary Trees2-Level order traversal		Binary Trees2-Level order traversal
Binary Trees2-Minimum and Maximum in the Binary Tree		Binary Trees2-Minimum and Maximum in the Binary Tree
Binary Trees2-Mirror Binary Tree		Binary Trees2-Mirror Binary Tree
Binary Trees2-Path Sum Root to Leaf		Binary Trees2-Path Sum Root to Leaf
Binary Trees2-Print Levelwise		Binary Trees2-Print Levelwise
Binary Trees2-Print nodes at distance k from node		Binary Trees2-Print nodes at distance k from node
Calculate Power- Recursion		Calculate Power- Recursion
LinkedList-Bubble Sort (Iterative) LinkedList		LinkedList-Bubble Sort (Iterative) LinkedList
LinkedList-Delete every N nodes		LinkedList-Delete every N nodes
LinkedList-Delete node Recursively		LinkedList-Delete node Recursively
LinkedList-Even after Odd LinkedList		LinkedList-Even after Odd LinkedList
LinkedList-Find a node in LL (recursive)		LinkedList-Find a node in LL (recursive)
LinkedList-Merge Sort LL		LinkedList-Merge Sort LL
LinkedList-Merge Two Sorted LL		LinkedList-Merge Two Sorted LL
LinkedList-Mid Point Linked List		LinkedList-Mid Point Linked List
LinkedList-Swap two Nodes of LL		LinkedList-Swap two Nodes of LL
LinkedList-kReverse		LinkedList-kReverse
Number of Digits- Recursion		Number of Digits- Recursion
Print First N Natural Numbers- Recursion		Print First N Natural Numbers- Recursion
Queue-Queue Using LL		Queue-Queue Using LL
Queue-Reverse Queue		Queue-Reverse Queue
Queue-Reverse the First K Elements in the Queue		Queue-Reverse the First K Elements in the Queue
Queue-Stack Using 2 Queues		Queue-Stack Using 2 Queues
README.md		README.md
Recursion- Sum Of Array		Recursion- Sum Of Array
Recursion-Check Number in Array		Recursion-Check Number in Array
Recursion-First Index Of a Number in an Array		Recursion-First Index Of a Number in an Array
Recursion-Last Index Of a Number in an Array		Recursion-Last Index Of a Number in an Array
Recursion-Merge Sort -Problem Statement		Recursion-Merge Sort -Problem Statement
Recursion-Quick Sort - Problem Statement		Recursion-Quick Sort - Problem Statement
Recursion-Remove Duplicates		Recursion-Remove Duplicates
Recursion-Remove X		Recursion-Remove X
Recursion-Tower Of Hanoi - Problem Statement		Recursion-Tower Of Hanoi - Problem Statement
Reverse LL (Recursive)		Reverse LL (Recursive)
Stack-Brackets Balanced		Stack-Brackets Balanced
Stack-Check redundant brackets		Stack-Check redundant brackets
Stack-Minimum bracket Reversal		Stack-Minimum bracket Reversal
Stack-Reverse Stack		Stack-Reverse Stack
Stack-Stack Using LL		Stack-Stack Using LL
Stack-Stock Span		Stack-Stock Span
Test5-Matrix Class		Test5-Matrix Class
Test5-Next Number		Test5-Next Number
Test5-Replace duplicate values		Test5-Replace duplicate values
Test5-Sort Linked List		Test5-Sort Linked List
Test6-Implement the Browser History		Test6-Implement the Browser History
Test6-Move To Last		Test6-Move To Last
Test6-Multiply Two Linked Lists		Test6-Multiply Two Linked Lists
Test6-Rotten Oranges		Test6-Rotten Oranges
Trees-Check if generic tree contain element x		Trees-Check if generic tree contain element x
Trees-Code : Number of nodes greater than x		Trees-Code : Number of nodes greater than x
Trees-Count leaf nodes		Trees-Count leaf nodes
Trees-Find Height		Trees-Find Height
Trees-Next larger element		Trees-Next larger element
Trees-Node having sum of children and node is max		Trees-Node having sum of children and node is max
Trees-Post-order Traversal		Trees-Post-order Traversal
Trees-Print Tree Level-wise		Trees-Print Tree Level-wise
Trees-Second Largest Element In Tree		Trees-Second Largest Element In Tree
Trees-Structurally identical		Trees-Structurally identical
Trees-Sum of all nodes		Trees-Sum of all nodes

Repository files navigation

Coding Ninjas-Data Structure-Java

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Coding Ninjas-Data Structure-Java

About

Releases

Packages

mmuskan22/Coding-Ninjas-Data_Struct-Java

Folders and files

Latest commit

History

Repository files navigation

Coding Ninjas-Data Structure-Java

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Packages