Print a binary tree level-by-level

Question

Amit Bansal · Accepted Answer

Implement BFS.

function GRAPH(){
  this.vertices = {};
  this.edges = {};
}

GRAPH.prototype.BFS = function(node) {
	let q = new Queue();
  const self = this;
  let currNode = self.vertices[node];
	q.enqueue(currNode);
  while(!q.isEmpty()){
  	console.log( "q is - " + q.print());
    let node = q.dequeue();
    node.visited = true;
    console.log("Node = " + node.data);
    self.edges[node.data] && self.edges[node.data].forEach(function(n) {
      if(!n.visited) {
      	console.log("n = " + n.data);
				q.enqueue(n);
      }
    });
  }
};

Anonym · Answer

static List currentLevel;
static List nextLevel;
    
    public static void printTree(Node n) {
        currentLevel = new ArrayList();
        nextLevel = new ArrayList();
        
        currentLevel.add(n);

        while(printLevel()) {
            System.out.println();
        }
        
    }
    
    public static boolean printLevel() {
        if(currentLevel.size() == 0) return false;
        
        for(Node n : currentLevel) {
            System.out.print(n.value + "  ");
            if(n.left != null) nextLevel.add(n.left);
            if(n.right != null) nextLevel.add(n.right);
        }
        currentLevel = nextLevel;
        nextLevel = new ArrayList();
        return true;
    }

LinkedIn

Frage im Vorstellungsgespräch bei LinkedIn

Antworten zu Vorstellungsgespräch

Beobachtete Unternehmen

Jobsuchen