Sign up now
to enroll in courses, follow best educators, interact with the community and track your progress.
Download
5 Properties of Binary Tree - Asked in GATE (in Hindi)
942 plays

More
This lesson is very important and asked many times in GATE EXAMS.

Sweta Kumari is teaching live on Unacademy Plus

Sweta Kumari
YouTuber (channel : GATE NoteBook) | Verified Educator | 2+ year Online Teaching Experience

U
Unacademy user
thank you sir. very precise. really helpful
Congratulations on becoming a verified educator Ma'am. At last, your hard work paid off. One request is there. Please add lessons to this course explaining the red black trees, splay trees, threaded trees and AVL rotations. It would be great if you can discuss all concepts like insertion of a node and deletion of a node in these trees. These are quite confusing and no where on the internet I was able to find a video explaining these topics in an easy manner.
Sweta Kumari
2 years ago
Thank you so much Chirag...Yes I will try to add the lessons
Chirag Jain
2 years ago
thank you
Sweta Kumari
2 years ago
Hey Chirag, Hope you are preparing well for exams. Have you watched all the courses according to the strategy? If yes then tell me that the courses are helpful or not through reviews....If not then why?
Chirag Jain
2 years ago
Ma'am, I have watched this course but found it difficult to understand the above topics while reading through the topic. Actually, I need your guidance for placement prep. but unacademy app does not allow unacademy educators to connect to other educators through messages option. How can I contact you for personal guidance?
Chirag Jain
2 years ago
Please help me.
Sweta Kumari
2 years ago
Chirag if you have any doubts...you can tell me here...
Chirag Jain
2 years ago
Ma'am, there are a large number of courses that you have made. If one wants to revise the subjects in a month time then how should he do? It becomes very confusing when people tell you to do this and that and that happens because computer science is a vast field. As an elder sister, please guide as to what topics one should focus on and what should be the strategy. As for this course, its great. Whatever topics you cover, you make them easily understandable. That is why, I like your videos. Its like an elder sister is sitting and teaching me. I think a course like 'Busting various myths on campus placements' or ' 30 days preparation strategy for campus placements' can help me.
Sweta Kumari
2 years ago
Chirag ....the courses that I have created on java programming are large in numbers...make sure watch only 1 course in a day....dont watch multiple courses.....chirag i want to inform you that since i got verified under GATE Category....I can only make courses on GATE CS .
Sweta Kumari
2 years ago
Chirag as you called me an elder sister.....This is really touching ....and I request you to kindly wait for some time ....Meanwhile I request my leader to create course on your topic...:)
Chirag Jain
2 years ago
All right ma'am. I understand. Thanks a lot.
Sweta Kumari
a year ago
Your welcome....if you find my courses helpful...then please rate and review the courses..
Chirag Jain
a year ago
sure, will do that.
Sweta Kumari
a year ago
Thank you Chirag for your valuable feedback.
Chirag Jain
a year ago
👍
Sweta Kumari
a year ago
Chirag, I would like to tell you the 15 days preparation strategy here for campus placement. Believe after these 15 days, You feel Many improvement in your technical part. For Technical : 1. Learn C Progranmming - I have created 2 courses on that , one is basics of 60 60 Minutes and other one is detailed interview questions on C. (It should be the first ) - DAY 1 & DAY 2 2. Now For Logic in c programming - I have created 2 courses on pattern printing , one is basic and other one is advanced.(Day 3 & Day4) 3,Storage Classes is a must watch course with tricks I have discussed.(Day 5) 4. For C++ , OOP concepts are very necessary....make sure you learn my 2 courses on this topic also. (DAY 6 & DAY 7) 5. For Java, Learn OOP Concepts (Prefer Java than C++, it is easy to understand). (DAY 8 ) I have also created courses on frameworks of java , (OPTIONAL) Spring framework (4 courses) Struts Framework (5 courses) JUnit Framework (1course) Selenium Webdriver (1 course) 5. JAVA Interview Preparation Course : Exception Handling , Multithreading , String Handling, Collection Framework. (DAY - 9,10) 6. From Computer network....learn 2 course of OSI Model layer with Tricks . (DAY 11) 7.DBMS - SQL JOINS (DAY 12) 8.OS - Deadlock , Process & Threads (DAY 13) 9. Algorithms - Short trick to learn Complexities(DAY 14) 10. DS - Array . Linked List, Trees(DAY 15) Only watch 1 course in a day....you will be easily able to cover that...…….since every course has 5-6 lessons ………….Only in 15 days you will be able to cover that.
Chirag Jain
a year ago
That is great. Thanks for making this great timetable for me. Definitely I will adhere to this timetable and improve my technical part. Thanks a lot. I have taken a screenshot of the above and saved it in evernote. As I progress, I'll keep commenting my progress in various courses for the sake of connection.
Sweta Kumari
a year ago
Yes …...Make sure to learn each and every lesson....and also if you Face any problem in understanding the concepts...then do share with me....This time table Is basically I have created on your demand.....so that you don't have to waste your time.....and you are brilliant...you will be able to do that......Please share your feedbacks also....
Chirag Jain
a year ago
Sure, I will definitely follow your advice.
Sweta Kumari
a year ago
Very Good....Keep Going :)
1)level of j=2 2) non linear
Sweta Kumari
10 months ago
superb suhrid...😊
Maximum no. of node E=2
Sweta Kumari
a year ago
Very good
Sweta Kumari
a year ago
A new Special Class by *Sweta Kumari* in the *GATE* Category is now Live! Course Name - *Smart Tricks to Crack Theory of Computations* Link -https://unacademy.com/plus/course/smart-tricks-to-crack-theory-of-computations/KLNGELW9 Enrolment start time - 12 Noon on 5th October 2018 Enrolment close time - 1:30 PM on 5th October 2018 No. of Seats - 1000 Promotional message - Registrations open at 12 Noon, 5th October for a few minutes. Live Class - *5th October 2018, 07:00 PM to 08:00 PM*
enrolled maam
Sweta Kumari
a year ago
great
binary tree also called non linear
Sweta Kumari
a year ago
very nice
  1. WELCOME LEARNERS Unacademy, because learning is priceless INDIA'S LARGEST LEARNING PLATFORM unacademy


  2. ABOUT ME top educator 2017 e My Name is SWETA KUMARI e Done B.TECH IN COMPUTER SCIENCE. Sweta Kumari Working as a Software Developer. : I have the desired capability and one B.TECH (CSE) From GGSIPU Software Engineer|Online Educator at Unacademy for Empowering Technical Programming in Students experience to how to deliver my knowledge in a unique way. FOLLOW M FOLLhttps://unacademy.com/user/hellosonuo1


  3. Programming and Data Structures Height = Number of levels = 4 Height Max level number +1 TREES Root =4 Level 0 Level 1 Level 2 M) Level 3 A tree diagram


  4. BINARY TREE


  5. 5 PROPERTIES OF TREE A HIERARCHICAL DATA STRUCTURE


  6. PROPERTY The maximum number of nodes at level 1' of a binary tree is 21 Here level is number of nodes on path from root to the node (including root and node). Level of root is 1. This can be proved by induction. For root, l , number of nodes -21-1 Assume that maximum number of nodes on level I is 2-1 Since in Binary tree every node has at most 2 children, next level would have twice nodes, i.e. 2* 2-1


  7. PROPERTY 2 Maximum number of nodes in a binary tree of height 'h' is 2h-1. Here height of a tree is maximum number of nodes on root to leaf path. : Height of a tree with single node is considered as 1. : This result can be derived from point 2 above. So maximum number of nodes in a binary tree of height h is 1+2+4+ This is a simple geometric series with h terms and sum of this series is 2h - In some books, height of a leaf is considered as 0. In this convention, the A tree has maximum nodes if all levels have maximum nodes. +2h-1. 1. above formula becomes 2h+1- 1


  8. PROPERTY 3 In a Binary Tree with N nodes, minimum possible height or minimum number of levels is Log2(N+1) / : This can be directly derived from point 2 above. o If we consider the convention where height of a leaf node is considered as O, then above formula for minimum possible height becomes [Log2(N+1)1-1


  9. PROPERTY A Binary Tree with L leaves has at least /Log2L /+1 levels. A Binary tree has maximum number of leaves (and minimum number of levels) when all levels are fully filled. Let all leaves be at level l, then below is true for number of leaves L. L 21-1 [From Point 1] 1= Log,L 1 + 1 where 1 is the minimum number of levels.


  10. PROPERTY In Binary tree, number of leaf nodes is always one more than nodes with two children. Where LNumber of leaf nodes T = Number of internal nodes with two children