Second Sessional Important Questions : Design And Algorithm
SE-4C
To view Code Click on Program Heading ☺☺ ○
Make all values of the tree -ive
Make all even values odd in a tree
Make all Odd values Even in a tree
Display only Odd values from Tree
Display Only Even values from Tree
Display only Leaf Nodes in a tree
Insert 100 in all Leaf nodes and 10 in all non leaf nodes using BST in C++
Convert Left Sub Tree of a Root into Right Sub Tree and Right sub Tree into Left Sub Tree ☺ ☻
Insert A Value on Left Side which is greater Then Root and Small Value on Right side
Traverse root left sub tree with post order ☻ and then print root ☻ and then root right sub tree with pre order ☻
Find Minimum node make it Root node attach rest of Tree with it such that BST property is not violated
Take Maximum Node Make it Root Node and attach rest of tree with it so that BST Property will not volatilized
Traverse Tree According To User Value :Get Value From User ☻
SE-4C
To view Code Click on Program Heading ☺☺ ○
Make all values of the tree -ive
Make all even values odd in a tree
Make all Odd values Even in a tree
Display only Odd values from Tree
Display Only Even values from Tree
Display only Leaf Nodes in a tree
Insert 100 in all Leaf nodes and 10 in all non leaf nodes using BST in C++
Convert Left Sub Tree of a Root into Right Sub Tree and Right sub Tree into Left Sub Tree ☺ ☻
Insert A Value on Left Side which is greater Then Root and Small Value on Right side
Traverse root left sub tree with post order ☻ and then print root ☻ and then root right sub tree with pre order ☻
Find Minimum node make it Root node attach rest of Tree with it such that BST property is not violated
Take Maximum Node Make it Root Node and attach rest of tree with it so that BST Property will not volatilized
Traverse Tree According To User Value :Get Value From User ☻
4 Comments to "Programming Examples"
keep it up man (Y)
MA good effort larkay keep it up......... (Y)
thanku g :*
Nice man
Post a Comment