Given a Binary Search Tree, Traverse the tree in Preorder, Postorder, and inorder traversal.
Flatten A Nested Object
Flatten a nested object that contains arrays and objects as children. The task is to make the object flat, i.e. there should be no nested children lef...
Remove Duplicates From a Linked List
Given a sorted linked list, delete all duplicates such that each element appear only once.
Depth First Search
Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting s...