Data-Structures.

1. Binary Tree

• [Display]
• [Size]
• [Sum, Max, Min]
• [Height]
• [Traversal]
• [Level Order]
• [Pre Post in Traversal]
• [KLevels Down]
• [Path to Leaf from Root]
• [Back from Left Cloned Tree]
• [Single Child Nodes]
• [Remove Leaves]
• [Diameter1]
• [Diameter2]
• [Diameter3]
• [Tilt]
• [BST Pair]
• [isBst]
• [Balanced Pair]
• [Largest BST]

2. Binary Search Tree

• [Display]
• [Size]
• [Sum, Max, Min]
• [Find]
• [Add at Leaf]
• [Level Order]
• [Remove]
• [Replace Sum of Larger]
• [Lowest Common Ancestor]
• [Path to Leaf from Root]
• [Nodes in Given Range]
• [Target Sum Pair]

3. Generic Tree

• [Display]
• [Size]
• [Max]
• [Mirror Tree]
• [Remove Leaves]
• [Linearize Tree]
• [Linearize Tree2]
• [Height]
• [Traversal]
• [Level Order Line Wise]
• [Find Element]
• [Node to Root Path]
• [Lowest Common Ancestor]
• [Distance Between Nodes]
• [Similar Tree]
• [Trees Mirror in Shape]
• [isSymmetric]
• [Multisolver - Min, Max, Sum, Height]
• [Predecessor and successor]
• [Ceil and Floor]
• [kth Largest]
• [Maximum Sum Subtree]

4. Linked List

• [Add Last]
• [Size]
• [Display]
• [Remove First]
• [Get First]
• [Get Last]
• [Get At]
• [Add First]
• [Add at Index]
• [Remove Last]
• [Get Node At]
• [Reverse Data Iterative]
• [Reverse Pointer Iterative]
• [Remove At]
• [Linked List to Stack Adapter]
• [Linked List to Queue Adapter]
• [kth Node from End]
• [Middle Element]
• [Merge Two Sorted List]
• [Mid Node]
• [Merge Sort]
• [Remove Dublicates]
• [Odd-Even]
• [kReverse]