3 New Problems on BST

[ashokdey]

🌳 What's Inside?

• findAncestors() to find all the ancestors of a given node.
• findHeightOfBST() to find all the ancestors of a given node.
• findKNodes() to find all the nodes k distance away from the root.

[TheSTL]

If a node is not found then return array should be empty in find-ancestors but it return array values where it visited.

[ashokdey]

I have re-implemented it.

[TheSTL]

find-ancestors search whole BST tree. Implementation should be done in O(logn(n)) time.
You can use this code...

function findAncestors(root, value) {
  /**
   * search the given node and meanwhile
   * keep pushing the visited nodes
   */
  if (root === null) return false;

  if (value < root.value) {
    const left = findAncestors(root.leftChild, value);
    if (left) {
      return [...left, root.value];
    }
    return false;
  }

  if (value > root.value) {
    const right = findAncestors(root.rightChild, value);
    if (right) {
      return [...right, root.value];
    }
    return false;
  }

  if (value === root.value) return [];

  return false;
}

[ashokdey]

find-ancestors search whole BST tree. Implementation should be done in O(logn(n)) time.
You can use this code...

function findAncestors(root, value) {
  /**
   * search the given node and meanwhile
   * keep pushing the visited nodes
   */
  if (root === null) return false;

  if (value < root.value) {
    const left = findAncestors(root.leftChild, value);
    if (left) {
      return [...left, root.value];
    }
    return false;
  }

  if (value > root.value) {
    const right = findAncestors(root.rightChild, value);
    if (right) {
      return [...right, root.value];
    }
    return false;
  }

  if (value === root.value) return [];

  return false;
}

I am both sad and happy, happy coz at least reached the best way using recursion in the first go, sad because I messed up with the edge case. 👥

[TheSTL]

💯