About this document
Understanding ptr in Data Structures by Kumar Puspesh is a document available to read on EtoBox.
1) The document contains 14 multiple choice questions about data structures like linked lists, queues, stacks, trees. 2) It asks about operations like deleting nodes from linked lists and binary trees, as well as the states of queues and stacks based on values of their front and rear/top pointers. 3) The questions test concepts like traversing binary trees, building expression trees from infix/postfix notations, and performing insert/delete operations in binary search trees.
- Author
- Kumar Puspesh
- Language
- EN