Implement scene nodes benchmarks

[Guilhermev25]

Implements

🟪Algorithm🟪 [Adding 5000 children]: Unnamed: Adding 5000 random children nodes without name. 🟪Algorithm🟪 [Adding 5000 children]: Named: Adding 5000 random children nodes with the same name (let the conflict resolution happen). 🟪Algorithm🟪 Moving node children: Move 5000 children nodes between two random positions 5000 times. 🟪Algorithm🟪 [Delete children]: in order: Remove all 5000 children in order, first to last. 🟪Algorithm🟪 [Delete children]: in reverse order: Remove all 5000 children in order, last to first. 🟪Algorithm🟪 [Delete children]: in random order: Remove all 5000 children in random order. 🟪Algorithm🟪 Get node: Create a complex scene hierarchy of 1000 nodes with random nesting, Obtain paths of all nodes, test performance of get_node() for each one from root node.

from Scene nodes (base Node class) section in #36 benchmarks list.

P.S.: get_node() benchmark iterations were changed to 5000 as 1000 runs too fast.