Linked list search complexity is Ο(n) Maximum degree of any vertex in a simple graph of vertices n is n - 1
Posts
tree nodes with edges types of binary tree 1)full or strict binary tree only have 0 or 2 child of every parent 2)perfect binary tree internal nodes have two child and leave nodes on same level 3)complete binary tree every filled is complete and all remaining keys are on left .. 4) Degenerate binary tree having only one child to every parent 5) skewed binary tree left skewed all childs on left right skewed all childs on right
concepts of c++ oops 1) Abstraction Abstraction means displaying only essential information and hiding the details . Data abstraction refers to providing only essential information about the data to the outside world, hiding the background details. 2) polymorphism The word polymorphism means having many forms. there are 2 types of polymorphism compile time and run time while run time virtual function is being used 3 Encapsulation In normal terms Encapsulation is defined as wrapping up of data and information under a single unit. In Object Oriented Programming, Encapsulation is defined as binding together the data and the functions that manipulates them. 4) Inheritance The capability of a class to derive properties and characteristics from another class is called Inheritance.