[英]How to print the level of every node in binary-tree?
Python-how to make a function in this code that will print the level of every node? Python-如何在此代码中创建一个将打印每个节点级别的函数?
referrer=input()
location=input()
readFAQ=input()
pagesVisited=input()
serviceChosen=input()
testCase=[referrer, location, readFAQ, pagesVisited, serviceChosen]
t=buildtree(trainingData)
printtree(t)
I have no clue what language you are using but here is how to print a binary tree in JavaScript. 我不知道您使用的是哪种语言,但这是如何在JavaScript中打印二进制树。
BinaryTree.prototype.preOrderTraversal = function(node){
if(node !== null){
console.log(node.data);
this.preOrderTraversal(node.left);
this.preOrderTraversal(node.right);
}
};
/**
* Post traversal prototype function
* preforms recursive Postorder traversal on the tree
*
* @param start node
*
* @return none
* @throws none
**/
BinaryTree.prototype.postOrderTraversal = function(node){
if(node != null){
this.postOrderTraversal(node.left);
this.postOrderTraversal(node.right);
console.log(node.data);
}
};
/**
* Inorder traversal prototype function
* preforms recursive inorder traversal on the tree
*
* @param start node
*
* @return none
* @throws none
**/
BinaryTree.prototype.inOrderTraversal = function(node){
if(node != null){
this.inOrderTraversal(node.left);
console.log(node.data);
this.inOrderTraversal(node.right);
}
};
/**
* Depth Frist Search prototype function
* preforms Depth First Search on the tree
*
* @param start node
*
* @return none
* @throws none
**/
BinaryTree.prototype.depthFirstSearch = function(node){
if(node == null)
return;
var stack = [];
stack.push(node);
while (stack.length > 0) {
console.log(node = stack.pop());
if(node.right!=null)
stack.push(node.right);
if(node.left!=null)
stack.push(node.left);
}
};
/**
* Breadth First Search prototype function
* preforms Breadth First Search on the tree
*
* @param start node
*
* @return none
* @throws none
**/
BinaryTree.prototype.breadthFirstSearch = function(node){
if(node == null)
return;
var queue = [];
queue.push(node);
while (queue.length > 0) {
console.log((node = queue.shift()));
if(node.left != null)
queue.push(node.left);
if(node.right != null)
queue.push(node.right);
}
};
There are more examples in C#, Java, Visual basic here 这在C#,Java的更多的例子时,Visual Basic 这里
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.