void insert()

in Valgrind_memcheck/BinaryTree.h [17:35]

• 19 lines of code
• 5 McCabe index (conditional complexity)

void insert(T* value, BinaryTreeNode<T>& node) {
    if(node.Value == nullptr) {
        node.Value = value;
    }
    else {
        if(value <= node.Value) {
            if(node.Left == nullptr) {
                node.Left = new BinaryTreeNode<T>();
            }
            insert(value, *node.Left);
        }
        else {
            if(node.Right == nullptr) {
                node.Right = new BinaryTreeNode<T>();
            }
            insert(value, *node.Right);
        }
    }
}