XOR Linked List | Memory Efficient Doubly Linked List

In this video, I have explained XOR doubly linked list. An ordinary Doubly Linked List requires space for two address fields to store the addresses of previous and next nodes. A memory efficient version of Doubly Linked List can be created using only one space for address field with every node. In the XOR linked list, instead of storing actual memory addresses, every node stores the XOR of addresses of previous and next nodes. Source code: https://github.com/fit-coder/fitcoderyoutube/tree/master/linked_list 00:00 Introduction 00:06 What is XOR Linked List 01:45 Explanation 06:23 Drawbacks 08:46 Implementation ------------------------------------------------------------- I live in New Delhi and love explaining programming concepts. I have done M.Tech(BITS Pilani) + B.Tech(PEC, Chandigarh) in Computer Science and am currently working as a software engineer in a MNC. If you like my content, please like, share my videos and subscribe to the channel. ------------------------------------------------------------- For Linked List tutorials, please refer to the below playlist: https://youtube.com/playlist?list=PLFj4kIJmwGu1oI1HVzAZlpJgKf9xv6mM1 For Binary tree tutorials, please refer to the below playlist: https://youtube.com/playlist?list=PLFj4kIJmwGu2VDN0qKVMmCbEeGBEpXzkX For Binary search tree tutorials, please refer to the below playlist: https://youtube.com/playlist?list=PLFj4kIJmwGu21Tv1mmsNFOf5pWUrSjr55 For in-depth Graph theory and implementation details, please refer to the below playlist: https://youtube.com/playlist?list=PLFj4kIJmwGu0yzwN3qZmw6p3E3zpoHpZz #DataStructure,#LinkedList,#FitCoder,#Algorithm,#competitiveprogramming,#faang,#codinginterview