1. Advanced Data Structure using C++

More documents

Recommendations

Info

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110) The algorithm to delete an arbitrary node from a binary tree is deceptively complex, as there are many special cases. The algorithm used for the delete function splits it into two separate operations, searching and deletion. Once the node which is to be deleted has been determined by the searching algorithm, it can be deleted from the tree. The algorithm must ensure that when the node is deleted from the tree, the ordering of the binary tree is kept intact. 1) The node to be deleted has no children. In this case the node may simply be deleted from the tree. before deletion of 2 after deletion of 2 node to be deleted A tree may be defined as a finite set ‘T’ of one or more nodes such that there is a node designated as the root of the tree and the other nodes (excluding the root) are divided into n≥0 disjoint sets T1,T2,………….,Tn and each of these sets is a tree in turn.The trees T1,T2,…………..,Tn are called the sub‐trees or children of the root. Generally, it is a convention to draw root node at the top and let the tree grow downwards. FIGURE:‐ 2 4 4 7 7 suresh sunita nikita Prepared By : Er. Harvinder Singh Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 188 ‐
LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110) pooja mala DEFINITION OF BINARY TREE:‐ Binary tree is a special type of tree in which every node or vertex has either no children, one child or two children. A binary tree is an important class of tree data structure in which a node can have atmost two children (which are sub‐ trees). Child of a node in a binary tree on the left is called the “left child” and the node in the right is called the “right child”. Similarly, a binary tree may also be defined as follows:‐ A binary tree is an empty tree. A binary tree consists of a node called root, a left sub tree and a right sub tree both of which are binary trees once again. ARRAY IMPLEMENTATION:‐ raj tina sita In an array binary tree, the nodes of the tree are stored in an array. Position 0 is left empty. The root is stored in position <strong>1.</strong> For the element in position n, the left child is in position 2n the right child is in position 2n+1 the parent is in position n/2. Prepared By : Er. Harvinder Singh Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 189 ‐
Page 1 and 2:
ADVANCED DATA STRUCTURE NOTES (MT
Page 3 and 4:
LECTURE NOTES OF ADVANCED DATA STRU
Page 5 and 6:
Page 7 and 8:
Page 9 and 10:
70 121 432 12 638 LECTURE NOTES OF
Page 11 and 12:
Page 13 and 14:
3 91 11 50 LECTURE NOTES OF ADVANCE
Page 15 and 16:
Page 17 and 18:
Page 19 and 20:
Page 21 and 22:
Page 23 and 24:
Page 25 and 26:
COLLISION LECTURE NOTES OF ADVANCED
Page 27 and 28:
4. Rehashing LECTURE NOTES OF ADVAN
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35 and 36:
Page 37 and 38:
Page 39 and 40:
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
Page 47 and 48:
Instructions: LECTURE NOTES OF ADVA
Page 49 and 50:
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
Page 57 and 58:
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
DESTINATION DESTINATION LECTURE NOT
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Algorithm LECTURE NOTES OF ADVANCED
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Page 137 and 138: LECTURE NOTES OF ADVANCED DATA STRU
Page 143 and 144: queue LECTURE NOTES OF ADVANCED DAT
Page 153 and 154: SEARCHING LECTURE NOTES OF ADVANCED
Page 167 and 168: Step 2: Step 3 LECTURE NOTES OF ADV
Page 177 and 178: a LECTURE NOTES OF ADVANCED DATA ST
Page 183 and 184: D LECTURE NOTES OF ADVANCED DATA ST
Page 187: 1 3 LECTURE NOTES OF ADVANCED DATA
Page 221 and 222: Search LECTURE NOTES OF ADVANCED DA
show all

1. Advanced Data Structure using C++

Create successful ePaper yourself

Delete template?

Save as template?