print_recursive()

template<uint32_t K>

void scl::kd_tree< K >::print_recursive ( Node * node, int depth ) const

inlineprivate

Recursive function to print the kd_tree.

Parameters

[in]	node	recursive node.
[in]	depth	recursive depth.

Base case: If node is null, return.

Print current node with indentation based on depth.

Recursively print left and right children.

Definition at line 529 of file KDTree.h.

    {
        if (node == nullptr) return;
 
        for (int i = 0; i < depth; i++)
        {
            std::cout << "  ";
        }
 
        std::cout << "(";
        for (size_t i = 0; i < K; i++) 
        {
            std::cout << node->m_Point[i];
            if (i < K - 1)
            {
                std::cout << ", ";
            }
        }
        std::cout << ")" << std::endl;
 
        print_recursive(node->m_Left, depth + 1);
        print_recursive(node->m_Right, depth + 1);
    }

References scl::kd_tree< K >::print_recursive().

Referenced by scl::kd_tree< K >::print(), and scl::kd_tree< K >::print_recursive().