Tree

•Create a node, with left and right part
•Take input in array
•Perform Inorder
•Print the Tree

•Create a node, with left and right
•Traverse Preorder
•Traverse Inorder
•Traverse Postorder
•Print all traversals

•Create a Binary Tree
•Count full nodes with help of root
•Print it

•Create a Binary Tree
•Stay connected with root
•Move with node count
•Print height of Tree

•Create a node
•Count with help of left and right
•Print it

•Create a node
•Delete left and right of node
•Must clear the node reference
•Tree is deleted

•Create a node
•Check if every node has 0 or 2 children
•Print Tree is Full or not

•Create a node
•Check all levels are completely filled and last level has all keys as left as possible
•Print 'is Tree Complete?'

•Create a node
•Check all the internal nodes have two children and all leaf nodes are at the same level
•Print Tree is Perfect or not

•Remember the properties
•Create a node
•Insert the key
•Delete key
•Traverse Inorder and print it