Maximum Depth of Binary Tree | Tree Interview problem | Interview problems tamil | Leetcode 104

  Рет қаралды 1,215

Algo Tamizha

Algo Tamizha

Күн бұрын

#leetcodetamil #codinginterviewproblemstamil #interviewproblemstamil
************************************************************
😎 Complete python beginner to advanced playlist : • learn python in tamil
🔥 Complete Java Beginner to Advanced playlist : • Java - Beginner to Adv...
😍 How to get Job in Zoho playlist : • Get job in zoho
✔ Placement Guidance for freshers and College Students : • placement guidance and...
❤ Leetcode problems with solutions : • leetcode problems
🔥 Data Structures in Tamil Explained : • Data Structures explai...
😎 Most Important C aptitude questions for programming interviews : • Aptitude Questions for...
*********************************************************
Thanks for watching
Maximum Depth of binary tree leetcode problem solution tamil,
leetcode java solutions tamil,
leetcode 104 tamil,
leetcode problems in tamil,
coding interview problems with solutions tamil,
easy,medium,hard coding interview problems with solutions in tamil,

Пікірлер: 11
@MAjay-qh1xd
@MAjay-qh1xd 2 жыл бұрын
Super bro
@AlgoTamizha
@AlgoTamizha 2 жыл бұрын
🙌
@dravidaravindkumar4207
@dravidaravindkumar4207 2 жыл бұрын
Hii bro can you put a video on stadium seat booking system with sql and python ...plss 🙏🙏
@RadhamaniRamadoss
@RadhamaniRamadoss Жыл бұрын
Hi..One question. If there is no left in one level for a node, then CalHeigth(root.left,height) --> in this root.left is null so root == null will be checked in recursion right? will it not return result without checking if next node has left or right?
@AlgoTamizha
@AlgoTamizha Жыл бұрын
it will return to the point after calHeight(root.left) was called. so it will still go for calHeight(root.right). That is how recursion will work. it will return back to the point after the call was made. it wont exit the entire function. hope i was able to solv ur doubt?
@syedabuthahir2421
@syedabuthahir2421 2 жыл бұрын
Bro main function code epdi bro
@kirubakaran1547
@kirubakaran1547 2 жыл бұрын
Level order traversal use pannalam bro for o(1) space.. Great explanation bro💥
@AlgoTamizha
@AlgoTamizha 2 жыл бұрын
yes, level order traversal also will work. but recursion la keta we can use DFS. ✌
@kirubakaran1547
@kirubakaran1547 2 жыл бұрын
@@AlgoTamizha bro dp problems epdi bro solve panrathu
@sheikabdullah.m945
@sheikabdullah.m945 2 жыл бұрын
Bro zoho oda adv pgm question -air trafic control program bro panna mutiyuma??
@AlgoTamizha
@AlgoTamizha 2 жыл бұрын
will try for sure 😄
The joker favorite#joker  #shorts
00:15
Untitled Joker
Рет қаралды 13 МЛН
Data Structures - 10 | Trees | Tamil
10:54
CS in Tamil
Рет қаралды 50 М.
I solved 541 Leetcode problems. But you need only 150.
7:42
Sahil & Sarra
Рет қаралды 2,3 МЛН