×
Home Discussions Write at Opengenus IQ
×
  • About
  • Track your progress
  • Deep Learning Projects
  • Python Projects
  • Join our Internship 🎓
  • RANDOM
  • 100+ Graph Algorithms
  • 100+ DP Problems
  • 50+ Linked List Problems
  • 50+ Array Problems
  • One Liner
  • 50+ Binary Tree problems
  • Home
  • Rust Projects

Uddeshya Raj

Uddeshya Raj is pursuing B. Tech in Computer Science from Chandigarh University. He is an Algorithm and Data Structure Developer, Intern at OpenGenus.

Patna, Bihar, India •
11 posts •
Problems on Binary Tree

BST to greater sum tree

In this article, we will be discussing about the problem "BST to greater sum tree" in detail. This involve the concept of inorder traversal.

Uddeshya Raj
Problems on Binary Tree

Minimum distance between two given nodes of Binary Tree

In this article, we will be discussing about the problem "Minimum distance between two given nodes of a Binary Tree" in detail. This involve the concept of lowest common ancestor.

Uddeshya Raj
Problems on Binary Tree

Connect Nodes at Same Level in Binary Tree

In this article, we will be discussing about the problem "Connect Nodes at Same Level in a Binary Tree" in detail. This involve the concept of Breadth First Search (BFS) or Level Order Traversal.

Uddeshya Raj
Problems on Binary Tree

Extreme nodes in alternate order

In this article, we will be discussing about the problem "Extreme nodes in alternate order in a Binary tree" in detail. This involve the concept of Breadth First Search (BFS) and level order traversal.

Uddeshya Raj
Problems on Binary Tree

Odd even level difference in a binary tree

In this article, I will be discussing about the problem "Children sum parent in a Binary Tree" in detail.

Uddeshya Raj
Problems on Binary Tree

Children sum parent in a Binary Tree

In this article, I will be discussing about the problem "Children sum parent in a Binary Tree" in detail.

Uddeshya Raj
Graph Algorithms

Maximum sum leaf to root path

In this article, I will be discussing about Maximum sum leaf to root path in Binary tree along with time and space complexity.

Uddeshya Raj
Algorithms

Stack vs Linked List

In this article, we will be discussing about "Stack vs Linked List" in detail.

Uddeshya Raj
Algorithms

Stack vs Queue [Differences]

In this article, we will be discussing about "Stack vs Queue" in detail.

Uddeshya Raj
Algorithms

Merge Insertion Sort

Merge Insertion Sort is the combination of Merge sort and Insertion sort that minimizes the worst case time complexity for smaller value of n.

Uddeshya Raj
Time Complexity

Worst Case of Merge Sort

In this article, we have covered the scenario when Merge Sort performs worst, how to identify such worst case inputs and Time Complexity analysis of Worst Case of Merge Sort.

Uddeshya Raj
OpenGenus IQ © 2023 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter