Basic algebra formulas that you can revise anytime and anywhere

FORMULAS FOR BEGINNER (a+b) ^2= a^2+b^2+2ab (a+b) ^2= (a-b) ^2+4ab (a-b) ^2= a^2+b^2-2ab (a-b) ^2= (a+b) ^2-4ab a^2+b^2= (a+b) ^2-2ab a^2+b^2= (a-b) ^2+ 2ab a^2-b^2= (a+b) (a-b) (a+b+c) ^2= a^2+b^2+c^2+2(ab+bc+ac) (a-b-c) ^2= a^2+b^2+c^2-2(ab-bc+ac) (a+b) ^3= a^3+b^3+3ab(a+b) (a-b) ^3= a^3-b^3+3ab(a-b) a^3+b^3= (a+b) (a^2-ab+b^2) a^3-b^3= (a-b) (a^2+ab+b^2) a^4-b^4= (a^2-b^2) (a^2+b^2) = (a^2+b^2) (a+b) (a-b) a^5+b^5= (a+b) (a^4-a^3b+a^2b^2-ab^3+b^4) a^5-b^5= (a-b) (a^4+a^3b+a^2b^2+ab^3+b^4)

Binary Tree Coding Questions

→How is a binary search tree implemented?

→How do you perform preorder traversal in a given binary tree?

→How do you traverse a given binary tree in preorder without recursion?

→How do you perform an inorder traversal in a given binary tree?

→How do you print all nodes of a given binary tree using inorder traversal without recursion?

→How do you implement a postorder traversal algorithm?

→How do you traverse a binary tree in postorder traversal without recursion?

→How are all leaves of a binary search tree printed?

→How do you count a number of leaf nodes in a given binary tree?

→How do you perform a binary search in a given array?

Comments

Popular posts from this blog

How to answer " What are your goals?"(HR QUESTION)

Basic algebra formulas that you can revise anytime and anywhere