Chanchal K.

Reviewed on 16 Jun, 2014

UGC NET Exam Coaching

"Chanchal sir, brings about the concept to clarity and to the approach of the students. He often make a healthy smile rather then getting nervous over the questions being put up by students, and give the solution with more simple and clear examples. He had being dynamic and active in nature, and often prepare well enough before class rather than just rough approach to throw way out. I as a student, was being pleased to be taught under his guidance and supervision.Hope he may get more laurels in this field. "

Reviewed on 16 Jun, 2014

UGC NET Exam Coaching

"Chanchal sir, brings about the concept to clarity and to the approach of the students. He often make a healthy smile rather then getting nervous over the questions being put up by students, and give the solution with more simple and clear examples. He had being dynamic and active in nature, and often prepare well enough before class rather than just rough approach to throw way out. I as a student, was being pleased to be taught under his guidance and supervision.Hope he may get more laurels in this field. "

Reviewed on 09 Jun, 2014

"Advanced Data Structure: Advanced Lists: Memory efficient doubly linked list, XOR Linked List – A Memory Efficient Doubly Linked List | Set 1, XOR Linked List – A Memory Efficient Doubly Linked List | Set 2, Skip List | Set 1 (Introduction), Self Organizing List | Set 1 (Introduction) Trie, Suffix Tree and Suffix Array: Trie | (Insert and Search), Trie | (Delete), Longest prefix matching – A Trie based solution in Java, Suffix Array Introduction, Suffix Array nLogn Algorithm, Suffix Tree Introduction, Print unique rows in a given boolean matrix. AVL Tree: AVL Tree | Set 1 (Insertion), AVL Tree | Set 2 (Deletion). Splay Tree: Splay Tree | Set 1 (Search), Splay Tree | Set 2 (Insert) B Tree: B-Tree | Set 1 (Introduction), B-Tree | Set 2 (Insert), B-Tree | Set 3 (Delete) Segment Tree: Segment Tree | Set 1 (Sum of given range), Segment Tree | Set 2 (Range Minimum Query) "

Reviewed on 09 Jun, 2014

"Array Bit Magic C/C++ Articles GFacts Linked List MCQ Misc Output String Tree Graph Data Structures Linked List: Singly Linked List: Introduction to Linked List, Linked List vs Array, Linked List Insertion, Linked List Deletion, How to write C functions that modify head pointer of a Linked List?, Write a function to get Nth node in a Linked List, Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?, Write a C function to print the middle of a given linked list, Nth node from the end of a Linked List, Write a function to delete a Linked List, Write a function that counts the number of times a given int occurs in a Linked List, Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?, Write a function to reverse a linked list, Write a C function to detect loop in a linked list, Function to check if a singly linked list is palindrome, Given a linked list which is sorted, how will you insert in sorted way, Write a function to get the intersection point of two Linked Lists., Write a recursive function to print reverse of a Linked List, Remove duplicates from a sorted linked list, Remove duplicates from an unsorted linked list, Pairwise swap elements of a given linked list, Practice questions for Linked List and Recursion, Move last element to front of a given Linked List, Intersection of two Sorted Linked Lists, Delete alternate nodes of a Linked List, Alternating split of a given Singly Linked List, Merge two sorted linked lists, Identical Linked Lists, Merge Sort for Linked Lists, Reverse a Linked List in groups of given size, Reverse alternate K nodes in a Singly Linked List, Delete nodes which have a greater value on right side, Segregate even and odd nodes in a Linked List, Detect and Remove Loop in a Linked List, Add two numbers represented by linked lists | Set 1, Delete a given node in Linked List under given constraints, Union and Intersection of two Linked Lists, Find a triplet from three linked lists with sum equal to a given number, Rotate a Linked List, Flattening a Linked List, Add two numbers represented by linked lists | Set 2, Sort a linked list of 0s, 1s and 2s, Flatten a multilevel linked list, Delete N nodes after M nodes of a linked list, QuickSort on Singly Linked List, Merge a linked list into another linked list at alternate positions, Pairwise swap elements of a given linked list by changing links Circular Linked List: Circular Linked List Introduction and Applications,, Circular Linked List Traversal, Split a Circular Linked List into two halves, Sorted insert for circular linked list Doubly Linked List: Doubly Linked List Introduction and Insertion, Delete a node in a Doubly Linked List, Reverse a Doubly Linked List, The Great Tree-List Recursion Problem., Copy a linked list with next and arbit pointer, QuickSort on Doubly Linked List, Swap Kth node from beginning with Kth node from end in a Linked List Quiz on Linked List Stack: Introduction to Stack, Infix to Postfix Conversion using Stack, Reverse a Sting using Stack, Implement two stacks in an array, Check for balanced parentheses in an expression, Next Greater Element, Reverse a stack using recursion, The Stock Span Problem, Design and Implement Special Stack Data Structure, Implement Stack using Queues, Design a stack with operations on middle element Quiz on Stack Queue: Queue Introduction and Array Implementation, Linked List Implementation of Queue, Applications of Queue Data Structure,Implement Queue using Stacks, Check whether a given Binary Tree is Complete or not, Find the largest multiple of 3, Find the first circular tour that visits all petrol pumps, Maximum of all subarrays of size k Quiz on Queue Binary Tree: Binary Tree Introduction, Applications of tree data structure, Tree Traversals, Write a C program to Calculate Size of a tree, Write C Code to Determine if Two Trees are Identical, Write a C Program to Find the Maximum Depth or Height of a Tree, Write a C program to Delete a Tree., Write an Efficient C Function to Convert a Binary Tree into its Mirror Tree, If you are given two traversal sequences, can you construct the binary tree?, Given a binary tree, print out all of its root-to-leaf paths one per line., The Great Tree-List Recursion Problem., Level Order Tree Traversal, Program to count leaf nodes in a binary tree, Level order traversal in spiral form, Check for Children Sum Property in a Binary Tree., Convert an arbitrary Binary Tree to a tree that holds Children Sum Property, Diameter of a Binary Tree, How to determine if a binary tree is height-balanced?, Inorder Tree Traversal without Recursion, Inorder Tree Traversal without recursion and without stack!, Root to leaf path sum equal to a given number, Construct Tree from given Inorder and Preorder traversals, Given a binary tree, print all root-to-leaf paths, Double Tree, Maximum width of a binary tree, Foldable Binary Trees, Print nodes at k distance from root, Get Level of a node in a Binary Tree, Print Ancestors of a given node in Binary Tree, Check if a given Binary Tree is SumTree, Check if a binary tree is subtree of another binary tree, Connect nodes at same level, Connect nodes at same level using constant extra space, Populate Inorder Successor for all nodes, Convert a given tree to its Sum Tree, Vertical Sum in a given Binary Tree, Find the maximum sum leaf to root path in a Binary Tree, Construct Special Binary Tree from given Inorder traversal, Construct a special tree from given preorder traversal, Check whether a given Binary Tree is Complete or not, Boundary Traversal of binary tree, Construct Full Binary Tree from given preorder and postorder traversals, Iterative Preorder Traversal, Morris traversal for Preorder, Linked complete binary tree & its creation, Ternary Search Tree, Segment Tree | Set 1 (Sum of given range), Largest Independent Set Problem, Iterative Postorder Traversal | Set 1 (Using Two Stacks), Iterative Postorder Traversal | Set 2 (Using One Stack), Reverse Level Order Traversal, Construct Complete Binary Tree from its Linked List Representation, Convert a given Binary Tree to Doubly Linked List | Set 1, Tree Isomorphism Problem, Find all possible interpretations of an array of digits, Iterative Method to find Height of Binary Tree, Custom Tree Problem, Convert a given Binary Tree to Doubly Linked List | Set 2, Print ancestors of a given binary tree node without recursion, Difference between sums of odd level and even level nodes of a Binary Tree, Print Postorder traversal from given Inorder and Preorder traversals, Find depth of the deepest odd level leaf node, Check if all leaves are at same level, Print Left View of a Binary Tree, Remove all nodes which don’t lie in any path with sum>= k, Extract Leaves of a Binary Tree in a Doubly Linked List, Deepest left leaf node in a binary tree, Find next right node of a given key, Sum of all the numbers that are formed from root to leaf paths, Convert a given Binary Tree to Doubly Linked List | Set 3, Lowest Common Ancestor in a Binary Tree | Set 1, Find distance between two given keys of a Binary Tree, Print all nodes that are at distance k from a leaf node, Check if a given Binary Tree is height balanced like a Red-Black Tree, Print all nodes at distance k from a given node, Print a Binary Tree in Vertical Order | Set 1, Print all nodes at distance k from a given node Construct a tree from Inorder and Level order traversals Quiz on Binary Tree Quiz on Binary Tree Traversals All articles on Tree Binary Search Tree: Search and Insert in BST, Deletion from BST, Minimum value in a Binary Search Tree Check if a binary tree is BST or not, Lowest Common Ancestor in a Binary Search Tree. Sorted order printing of a given array that represents a BST, Inorder Successor in Binary Search Tree, Find k-th smallest element in BST (Order Statistics in BST), Print BST keys in the given range, Sorted Array to Balanced BST, Find the largest BST subtree in a given Binary Tree, Check for Identical BSTs without building the trees, Add all greater values to every node in a given BST, Remove BST keys outside the given range, Check if each internal node of a BST has exactly one child, Find if there is a triplet in a Balanced BST that adds to zero, Merge two BSTs with limited extra space, Two nodes of a BST are swapped, correct the BST, Construct BST from given preorder traversal | Set 1, Construct BST from given preorder traversal | Set 2, Floor and Ceil from a BST, Convert a BST to a Binary Tree such that sum of all greater keys is added to every key, Sorted Linked List to Balanced BST, In-place conversion of Sorted DLL to Balanced BST, Find a pair with given sum in a Balanced BST, Total number of possible Binary Search Trees with n keys, Merge Two Balanced Binary Search Trees, Binary Tree to Binary Search Tree Conversion Quiz on Binary Search Trees Quiz on Balanced Binary Search Trees Graph: Introduction, DFS and BFS: Graph and its representations, Breadth First Traversal for a Graph, Depth First Traversal for a Graph, Applications of Depth First Search, Detect Cycle in a Directed Graph, Detect Cycle in a an Undirected Graph, Detect cycle in an undirected gr "