Question: c++ GENERAL QUESTIONS: Binary Tree - Complete Binary Tree - Binary Search Tree -AVL Tree- Perfectly Balanced Binary Tree Leaf - Height of tree -

 c++ GENERAL QUESTIONS: Binary Tree - Complete Binary Tree - Binary

c++

GENERAL QUESTIONS: Binary Tree - Complete Binary Tree - Binary Search Tree -AVL Tree- Perfectly Balanced Binary Tree Leaf - Height of tree - balance factor (in AVL)- Rotation types -single, double Relationships among #nodes, #leaves,height, shape, levels of BT/BST Usage of different types of traversals of BST a. b. Draw AVL tree after insertion of items (show rotations) c. Draw BST given order of values inserted d. Draw BST after deletion of itemm e. Give PREORDER, INORDER and POSTORDER of BST EXAMPLES OF FUNCTIONS (recursive or iterative): Descendants- Ancestors Max, min, greater than given item, smaller than given item Counting or printing nodes or children of nodes according to property of nodes Iterative preorder, search, insert

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!