×
Home Discussions Write at Opengenus IQ
×
  • DSA Cheatsheet
  • HOME
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • RANDOM
  • One Liner
Vridhi Kamath

Vridhi Kamath

3 posts •
Algorithms

Morris Inorder Traversal in Binary Tree

In this article, you will learn about a method to traverse a tree in O(1) space complexity that is without using recursion or stack. We will use the concept of Single Threaded Binary Tree.

Vridhi Kamath Vridhi Kamath
Search Algorithms

Iterative Deepening Search

In this article, we are going to discuss about the Iterative Deepening Search Technique. It is also, known as Iterative Deepening Depth-First Search ( IDDFS) and is a modification of Depth First Search and Depth Limited Search.

Vridhi Kamath Vridhi Kamath
C++

Different ways to reverse vector in C++ STL

In this article, we take a look at different ways to reverse vector in C++ Standard Template Library (STL) along with reversing a 2D vector.

Vridhi Kamath Vridhi Kamath
OpenGenus IQ © 2025 All rights reserved â„¢
Contact - Email: team@opengenus.org
Primary Address: JR Shinjuku Miraina Tower, Tokyo, Shinjuku 160-0022, JP
Office #2: Commercial Complex D4, Delhi, Delhi 110017, IN
Top Posts LinkedIn Twitter
Android App
Apply for Internship