Data Structure, Data, Data Information, Programming, Coading, Algorithm,Linked,List,Tree,Sorting,Searching,Complexity,String, Stack,Queues,Recursion, Polish Notation,Ackermann Function, Tower of Hanoi,Graph, Shortest Path Algorithm, Warshall's.
Two basic Operation Of Stack
Two basic Operation Of Stack:
(a) "PUSH" is the term used to insert an element into a stack.
(b) "POP" is the term used to remove an element into a stack.
If You want to learn about the technol… Read MoreExample Of Factorial Function
Example Of Factorial Function: n! = 1.2.3...............(n-2)(n-1)n
0! = 1 1! = 1 2! = 1.2 = 2 &… Read MoreTraversing Binary Tree
Traversing Binary Tree: There are three standard ways of traversing a binary tree T with root R. These three algorithms, called preorder, inorder and postorder.
Preorder:
&n… Read MoreWhat is Binary Trees?
Binary Trees: A binary tree T is defined set of elements, called nodes, such that:
(a) T is empty (called the null tree or empty tree), or
(b) T constants a distinguished node R, called the root of T, and the remainin… Read MoreWhat is Recursion?
Recursion: A recursive must have two proprties
(a) There must be certain criteria, called base criteria, for which the procedure does not call itself.
(b) Each time the procedure does call itself (di… Read More
Posts
0 comments:
Post a Comment