A method of traversing an acceleration structure for ray tracing by an apparatus; the method comprising: in a first state: obtaining information about a plurality of child nodes of a target node that is included in the AS, wherein the obtained information is preset in a data structure and the data structure comprises memory addresses at which the child nodes are stored, indices indicating the child nodes, type information of the child nodes, and bounding box information of the child nodes; determining, simultaneously, whether each of the plurality of child nodes intersects a ray based on the obtained information in one traversal process; determining a next target node from among at least one child node that intersects the ray; performing an operation corresponding to a type of the determined next target node; wherein the performing of the operation corresponding to the type of the determined next target node comprises: if the next target node is an inner node, moving to at least one child node of the next target node, if the next target node is a leaf node, transmitting information about the leaf node to a second state, and if there exists no target node, transmitting the result of the traversal process to a third state and ending the traversal process; wherein the method comprises, in the second state, repeatedly determining whether at least one primitive that is included in the leaf node intersects the ray; and the method comprises, in the third state, determining the color value of a pixel based on the intersection information obtained. obtaining information about a plurality of child nodes of a target node that is included in the AS, wherein the obtained information is preset in a data structure and the data structure comprises memory addresses at which the child nodes are stored, indices indicating the child nodes, type information of the child nodes, and bounding box information of the child nodes; determining, simultaneously, whether each of the plurality of child nodes intersects a ray based on the obtained information in one traversal process; determining a next target node from among at least one child node that intersects the ray; performing an operation corresponding to a type of the determined next target node; wherein the performing of the operation corresponding to the type of the determined next target node comprises: if the next target node is an inner node, moving to at least one child node of the next target node, if the next target node is a leaf node, transmitting information about the leaf node to a second state, and if there exists no target node, transmitting the result of the traversal process to a third state and ending the traversal process; wherein the method comprises, in the second state, repeatedly determining whether at least one primitive that is included in the leaf node intersects the ray; and the method comprises, in the third state, determining the color value of a pixel based on the intersection information obtained. if the next target node is an inner node, moving to at least one child node of the next target node, if the next target node is a leaf node, transmitting information about the leaf node to a second state, and if there exists no target node, transmitting the result of the traversal process to a third state and ending the traversal process; wherein the method comprises, in the second state, repeatedly determining whether at least one primitive that is included in the leaf node intersects the ray; and the method comprises, in the third state, determining the color value of a pixel based on the intersection information obtained.