Here are two codes utilized by my platform to establish relationships between nodes. code1 :
const getNodeRelationship = (node1, node2) => {
// if node1 and node2 are the same node
if (node1 === node2) return null;
// check direct parent
let parent = node1.parentElement
if (parent === node2) {
return 'parent';
}
// if both node1 and node2 have the same parent
if (node1.parentNode === node2.parentNode) {
return 'sibling';
}
// check direct children
for (const child of node1.children) {
if (child === node2) return 'child';
}
return null;
}
code2:
const getNodeRelationship = (node1, node2) => {
// Helper function to check the relation between the two nodes
const checkParentDirectChild = (parent, child) => {
// If the parent node exists, iterate over its childNodes
if (parent) {
for (const curNode of parent.childNodes) {
if (curNode === child) {
return true;
}
}
}
return false;
}
// if node1 and node2 are the same node
if (node1 === node2) {
return null;
}
// if node2 is a direct child of node1
if (checkParentDirectChild(node1, node2)) {
return 'child';
}
// if node1 is a direct child of node2
if (checkParentDirectChild(node2, node1)) {
return 'parent';
}
// if both node1 and node2 have the same parent
if (checkParentDirectChild(node1.parentNode, node2) && checkParentDirectChild(node2.parentNode, node1)) {
return 'sibling';
}
return null;
}
I believe the time complexity and space complexity will be O(1) for both codes since they only evaluate direct parent-child connections between nodes. This eliminates the need for any DFS or BFS algorithms.
However, in a scenario where node1 has millions of child nodes and node2 is the final one, wouldn't the loop run a million times in both proposed solutions?
I am unsure. Can someone help me confirm the time and space complexities involved?