Trees, Binary Tree and Binary Search Tree Lesson Plan - 1. - презентация

1 Trees, Binary Tree and Binary Search Tree Lesson Plan - 1

2 Contents Evocation Objective Introduction Binary Tree Examples Algorithm Mind map Summary

3 ANNEXURE-I Evocation

4 Objective To acquire knowledge about the basic concept of Trees, Binary Tree and Binary Search Tree with examples

5 ANNEXURE-II Introduction - Tree Need of Binary Tree

6 Cont.,

7

8

9

10

11

12

13 Binary Tree

14 Cont.,

15 Cond.,

16

17 Binary Search Tree

18

19

20

21 Deleting a node from the tree

22 Contd., 1.everything in left subtree < X 2.everything in right subtree > X

23 Contd., 1.everything in left subtree < X 2.everything in right subtree > X

24 Contd.,

25 Binary Search Tree

26 Problems for Students Construct a binary tree and Binary Search Tree for the given (a) (b) (c) (d) (e)

27 ANNEXURE-III Progressive muscular relaxation Stressed muscles are tight, tense muscles By learning to relax your muscles, you will be able to use your body to dissipate stress Neck Tense your neck by pulling your chin down to your chest. Hold; then relax Back Arch your back. Hold; then relax Chest Breathe in as deeply as you can. Hold; then relax Forearms and hands Tense your arms and clench your fists. Hold; then relax Calves Press your feet down. Hold; then relax Ankles and feet Pull your toes up. Hold; then relax

28 Logo Identification

29 Puzzles Can you leave three squares only, by taking away six sticks from the pattern shown below?

30 Abbreviations HMI IFC IDBI CRIS

31 ANNEXURE-IV Mind Map Basic Trees and Binary Trees Basic Trees Binary Trees User Represen tations Terminologies Properties

32 ANNEXURE-V Summary Binary Tree holds two children for a parent The searching time is reduced for by using BST For constructing binary tree the numbers must be sorted Efficiency of binary search is O(logn)