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

Contents Evocation Objective Introduction Binary Tree Examples Algorithm Mind map Summary

ANNEXURE-I Evocation

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

ANNEXURE-II Introduction - Tree Need of Binary Tree

Cont.,

Binary Tree

Cont.,

Cond.,

Binary Search Tree

Deleting a node from the tree

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

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

Contd.,

Binary Search Tree

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

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

Logo Identification

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

Abbreviations HMI IFC IDBI CRIS

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

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)