Find Middle of a singly linked list(Algorithm/Code/Program)
Given a linked list. Find the middle of the singly linked list.
Given a linked list. Find the middle of the singly linked list.
Print diagonal elements in binary tree(code/Algorithm/Program)
1.4 Pointers and arrays | Data structure
L-3.13: Heap sort with Example | Heapify Method
Traversal in Binary Tree (InOrder, PostOrder and PreOrder Traversals)
2.10 Implementation of Doubly Linked List - Data Structures