Diameter of a Binary Tree (Code/ Algorithm)
Find the diameter of a binary tree. The number of nodes on the longest path in a binary tree is the diameter. This is a recursive code.
Find the diameter of a binary tree. The number of nodes on the longest path in a binary tree is the diameter. This is a recursive code.
Height of a Binary Tree / Maximum depth of a binary tree Algorithm [REVISITED]
Quicksort example
Topological Sorting | GeeksforGeeks
6 Introduction to Backtracking - Brute Force Approach
C Code For Implementing Stack Using Array in Data Structures