This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
startExternalMap() { | |
if (this.location.latitude) { | |
this.platform.ready().then(() => { | |
Geolocation.getCurrentPosition().then((position) => { | |
// ios | |
if (this.platform.is('ios')) { | |
window.open('maps://?q=' + this.location.name + '&saddr=' + position.coords.latitude + ',' + position.coords.longitude + '&daddr=' + this.location.latitude + ',' + this.location.longitude, '_system'); | |
}; | |
// android | |
if (this.platform.is('android')) { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public class minHeap { | |
public int capacity; | |
public int [] mH; | |
public int currentSize; | |
public minHeap(int capacity){ | |
this.capacity=capacity; | |
mH = new int [capacity+1]; | |
currentSize =0; | |
} | |
public void createHeap(int [] arrA){ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* Deleting a node from Binary search tree */ | |
#include<iostream> | |
using namespace std; | |
struct Node { | |
int data; | |
struct Node *left; | |
struct Node *right; | |
}; | |
//Function to find minimum in a tree. | |
Node* FindMin(Node* root) |