Pre-order traversal Steps Visit the root node traverse the left sub-tree in pre-order traverse the right sub-tree in pre-order Algorithm Step 1:…
Tag:
structure
-
-
Insertion in circular doubly linked list at end There are two scenario of inserting a node in circular doubly linked list at…
-
Searching Searching means finding or locating some specific element or node within a data structure. However, searching for some specific node in…
-
Deletion in AVL Tree Deleting a node from an AVL tree is similar to that in a binary search tree. Deletion may…
-
Insertion into circular singly linked list at the end There are two scenario in which a node can be inserted in circular…
-
Deletion Delete function is used to delete the specified node from a binary search tree. However, we must delete a node from…
-
Insertion into circular singly linked list at beginning There are two scenario in which a node can be inserted in circular singly…
-
Deletion in Circular doubly linked list at beginning There can be two scenario of deleting the first node in a circular doubly…
-
Insertion in doubly linked list after Specified node In order to insert a node after the specified node in the list, we…
-
Deletion in circular doubly linked list at end There can be two scenario of deleting the first node in a circular doubly…
Newer Posts