public void ReplaceChild(int parentNodeId, int replacableNode, int childnodeId) { int max = childCount[parentNodeId]; for (int i = 0; i < max; i++) { if (nodeChildren[parentNodeId][i] == replacableNode) { nodeChildren[parentNodeId][i] = childnodeId; parent[childnodeId] = parentNodeId; } } }