Placement Mentor

How does a web session work

Placement Mentor

MySQL tutorial for beginners - Full Course

Placement Mentor

8 detective riddles to test your logic skills

Placement Mentor

7 riddles to test your brain power

Placement Mentor

DS-42 Graph Representation - Part 3 - Adjacency list

Placement Mentor

DS-41 Graph Representation - Part 2 - Adjacency Matrix

Placement Mentor

DS-40 Graph Representation - Part 1 - Edge List

Placement Mentor

DS-39 Properties of Graphs

Placement Mentor

DS-37 In-order successor in a binary search tree

Placement Mentor

DS-38 Introduction to graphs

Placement Mentor

DS-36 Delete a node from Binary Search Tree

Placement Mentor

DS-35 Check if a binary tree is binary search tree or not

Placement Mentor

DS-34 Binary tree traversal - Preorder, Inorder, Postorder

Placement Mentor

DS-33 Binary tree - Level Order Traversal

Placement Mentor

DS-32 Binary tree traversal - breadth first and depth first strategies

Placement Mentor

DS-31 Find height of a binary tree

Placement Mentor

DS-30 Find min and max element in a binary search tree

Placement Mentor

DS-29 BST implementation - memory allocation in stack and heap

Placement Mentor

DS-28 Binary search tree - Implementation in CC++

Placement Mentor

DS-27 Binary Search Trees

Placement Mentor

DS-26 Binary Trees

Placement Mentor

DS-25 Introduction to Trees

Placement Mentor

DS-24 Linked List implementation of Queue

Placement Mentor

DS-23 Array implementation of Queue

Placement Mentor

DS-22 Introduction to Queues

Placement Mentor

DS-21 Infix to Postfix using stack

Placement Mentor

DS-20 Evaluation of Prefix and Postfix expressions using stack

Placement Mentor

DS-19 Infix Prefix and Postfix

Placement Mentor

DS-18 Check for balanced parentheses using stack

Placement Mentor

DS-17 Reverse a string or linked list using stack

Placement Mentor