Maximum Binary Tree | leetcode 654 | Hindi

Показать описание

Рекомендации по теме

Комментарии

Can you please add the solution for the O(n) Time complexity. I can't understand the intuition bheind that

sparshsharma

Pls explain optimized code....this is a basic approach that everyone can understand by reading discussion....

sudhanshusingh

I saw just 3 mins of video and solved the question. Thanks for the upload and clarification.

kirtimanmishra

Very well explained all algorithm video! Appreciated..Please add more videos lucky Kumar. I agreed with someone's comment that this is an underrated channel and it should have more subscribers and views for sure.

MrRaviBhavsar

What a great video, please keep uploading more videos, subscribed :)

siddharth

Very neat code and nice explanation! Thx!

anant

need optimized code explaination using stack

hellohi-uyhq

Please explain this... with Monotonic Stack which reduces TC

ommapari

Your Videos are just Awesome, bro please
do make one seperate playlist on binary tree that contains all good problems

pragneshamadavadi

bhaiya can you please suggest some tree construction questions on leetcode easy-medium

PIYUSH-lzzq

My C++ code:
TreeNode* buildtree(vector<int> &nums, int start, int end)
{
int maxi=INT_MIN, index=-1;
for(int i=start;i<=end;i++)
{
if(nums[i]>maxi)
{
maxi=nums[i];
index=i;
}
}
if(index==-1)
return NULL;
TreeNode *root=new TreeNode(nums[index]);
root->left=buildtree(nums, start, index-1);
root->right=buildtree(nums, index+1, end);
return root;

}
TreeNode* nums) {
return buildtree(nums, 0, nums.size()-1);
}

vibeStationPS

people come here to search the optimal solution, not a brute force solution

shivangagrawal

what is the time complexity of this algorithm

raghavjha

Awsm explaination sir.. Can you plz make one video on factor combinations problem on leetcode.

rupalitiwari

Amazing lectures.
You have not been posting for sometime.
Really missed your videos

aparajitapandey

this is not a very good solution because time complexity here is o(n2)

ROUNAKSHARMAgsme

can you help me whats wrong with this code
class Solution {
public:
int m(vector <int> nums, int l, int r)
{
int i;
int m=l, mv=nums[l];

for(i=l;i<=r;i++)
{
if(nums[i]>mv)
{mv=nums[i];
m=i;
}}
return i;
}
TreeNode *construct(vector <int> nums, int l, int r)
{ if(l>r)
return NULL;
else if(l==r)
{TreeNode *root=new TreeNode(nums[l]);
return root;
}
else{
int t=m(nums, l, r);

TreeNode *root=new TreeNode(nums[t]);
root->left=construct(nums, l, t-1);
root->right=construct(nums, t+1, r);
return root;

}

}
TreeNode* nums) {
TreeNode *root=NULL;

return construct(nums, 0, nums.size()-1);

}
};

ashishsemwal

Maximum Binary Tree | leetcode 654 | Hindi

Maximum Binary Tree (LeetCode 654) | Full Solution with a natural way to approach | Recursion

Binary Tree Maximum Path Sum - DFS - Leetcode 124 - Python

Maximum Depth of Binary Tree - 3 Solutions - Leetcode 104 - Python

Leetcode 654 | Maximum Binary Tree | DFS

LeetCode 654. Maximum Binary Tree

LeetCode 257. Binary Tree Paths (Algorithm Explained)

Binary Tree Maximum Path Sum (Animated Walkthrough) (LeetCode)

Leetcode 654. Maximum Binary Tree. Recursion.

Adobe Coding Interview Question - Max Depth of Binary Tree (Height) - Leetcode 104

Diameter of Binary Tree - Leetcode 543

Maximum Width of Binary Tree - Leetcode 662 - Python

MAXIMUM PRODUCT OF SPIT BINARY TREE | LEETCODE # 1339 | PYTHON POSTORDER DFS SOLUTION

Leetcode 654 Maximum Binary Tree Lintcode 1106 · Maximum Binary Tree - Microsoft Question

L28. Maximum Width of Binary Tree | C++ | Java

LeetCode 104. Maximum Depth of Binary Tree - Interview Prep Ep 65

leetcode 654. Maximum Binary Tree - recursion

Maximum Depth of Binary Tree (LeetCode 104) | Full Solution with animations | Study Algorithms

Everything you need to know about Heaps (Min Heap / Max Heap Data Structures)

a little secret for binary tree questions 🤫

Maximum Binary Tree - LeetCode Problem #654

L17. Maximum Path Sum in Binary Tree | C++ | Java

leetcode 998. Maximum Binary Tree II - recursion

L53. Largest BST in Binary Tree

Binary Tree Maximum Path Sum - LeetCode Day 29 Challenge