Bt to DLL be keeping track of visited nodes

will start to traverse the tree with level order traversal - Level order traversal follows BFS(Breadth-First Search) to visit/modify every node of the treeInstructions - tree has left and right node,how to store that in dll- one way can be do it just like we do in array, store root at nth position and left and right node at 2n - 1- array representation starts by numbering nodes from 1 to n…