<!doctype html>
<html lang="en">
<head>
<meta charset="UTF-8">
<title>js递归树</title>
</head>
<body>
<script>
var start = 0,max = 6;
function tree(start,max){
start++;
if(start < max){
for(var i = (max-start)/2;i > 0;i --){
document.write(" ");
}
for(var i = start;i > 0;i --){
document.write("*");
}
document.write("<br />");
tree(start,max);
}
for(var i = (max-start)/2;i > 0;i --){
document.write(" ");
}
for(var i = start;i > 0;i --){
document.write("*");
}
document.write("<br />");
return;
}
tree(start,max);
</script>
</body>
</html>
<html lang="en">
<head>
<meta charset="UTF-8">
<title>js递归树</title>
</head>
<body>
<script>
var start = 0,max = 6;
function tree(start,max){
start++;
if(start < max){
for(var i = (max-start)/2;i > 0;i --){
document.write(" ");
}
for(var i = start;i > 0;i --){
document.write("*");
}
document.write("<br />");
tree(start,max);
}
for(var i = (max-start)/2;i > 0;i --){
document.write(" ");
}
for(var i = start;i > 0;i --){
document.write("*");
}
document.write("<br />");
return;
}
tree(start,max);
</script>
</body>
</html>